scholarly journals Congruence properties of indices of triangular numbers multiple of other triangular numbers

2021 ◽  
Vol 5 (1) ◽  
pp. 262-269
Author(s):  
Vladimir Pletser ◽  

For any non-square integer multiplier \(k\), there is an infinity of triangular numbers multiple of other triangular numbers. We analyze the congruence properties of indices \(\xi\) of triangular numbers multiple of triangular numbers. Remainders in congruence relations \(\xi\) modulo \(k\) come always in pairs whose sum always equal \((k-1)\), always include 0 and \((k-1)\), and only 0 and \((k-1)\) if \(k\) is prime, or an odd power of a prime, or an even square plus one or an odd square minus one or minus two. If the multiplier \(k\) is twice the triangular number of \(n\), the set of remainders includes also \(n\) and \((n^{2}-1)\) and if \(k\) has integer factors, the set of remainders include multiples of a factor following certain rules. Algebraic expressions are found for remainders in function of \(k\) and its factors, with several exceptions. This approach eliminates those \(\xi\) values not providing solutions.

2021 ◽  
Vol 14 (2) ◽  
pp. 380-395
Author(s):  
Jiramate Punpim ◽  
Somphong Jitman

Triangular numbers have been of interest and continuously studied due to their beautiful representations, nice properties, and various links with other figurate numbers. For positive integers n and l, the nth l-isosceles triangular number is a generalization of triangular numbers defined to be the arithmetic sum of the formT(n, l) = 1 + (1 + l) + (1 + 2l) + · · · + (1 + (n − 1)l).In this paper, we focus on characterizations and identities for isosceles triangular numbers as well as their links with other figurate numbers. Recursive formulas for constructions of isosceles triangular numbers are given together with necessary and sufficient conditions for a positive integer to be a sum of isosceles triangular  numbers. Various identities for isosceles triangular numbers are established. Results on triangular numbers can be viewed as a special case.


1970 ◽  
Vol 17 (1) ◽  
pp. 33-38
Author(s):  
Margaret A. Hervey ◽  
Bonnie H. Litwiller

Number patterns have interested mathematicians from the time of the ancient Greeks. Some of this interest centered around the relations between number expressed geometrically and algebraically. This idea is basic to the study of polygonal numbers. Polygonal numbers, which are sometimes called figurate numbers, include triangular numbers, square numbers. pentagonal numbers, hexagonal numbers, and so on. For example, if a number of objects can be arranged in the form of a regular triangle, that number is considered to be a triangular number. Figure I shows a geometrical pattern for the first five triangular numbers.


In examining the properties of the triangular numbers 0, 1, 3, 6, 10, &c., the author observed that every triangular number was com­posed of four triangular numbers, viz. three times a triangular num­ber plus the one above it or below it; and he found that all the natural numbers in the interval between any two consecutive triangular numbers might be composed of four triangular numbers having the sum of their roots, or rather of the indices of their distances from the first term of the series constant, viz. the sum of the indices of the four triangular numbers which compose the first triangular number of the two .


Author(s):  
N. A. Balonin ◽  
M. B. Sergeev ◽  
J. Seberry ◽  
O. I. Sinitsyna

Introduction: The Hadamard conjecture about the existence of Hadamard matrices in all orders multiple of 4, and the Gauss problem about the number of points in a circle are among the most important turning points in the development of mathematics. They both stimulated the development of scientific schools around the world with an immense amount of works. There are substantiations that these scientific problems are deeply connected. The number of Gaussian points (Z3 lattice points) on a spheroid, cone, paraboloid or parabola, along with their location, determines the number and types of Hadamard matrices.Purpose: Specification of the upper and lower bounds for the number of Gaussian points (with odd coordinates) on a spheroid depending on the problem size, in order to specify the Gauss theorem (about the solvability of quadratic problems in triangular numbers by projections onto the Liouville plane) with estimates for the case of Hadamard matrices. Methods: The authors, in addition to their previous ideas about proving the Hadamard conjecture on the base of a one-to-one correspondence between orthogonal matrices and Gaussian points, propose one more way, using the properties of generalized circles on Z3 .Results: It is proved that for a spheroid, the lower bound of all Gaussian points with odd coordinates is equal to the equator radius R, the upper limit of the points located above the equator is equal to the length of this equator L=2πR, and the total number of points is limited to 2L. Due to the spheroid symmetry in the sector with positive coordinates (octant), this gives the values of R/8 and L/4. Thus, the number of Gaussian points with odd coordinates does not exceed the border perimeter and is no less than the relative share of the sector in the total volume of the figure.Practical significance: Hadamard matrices associated with lattice points have a direct practical significance for noise-resistant coding, compression and masking of video information.


Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 474 ◽  
Author(s):  
Lazaros Moysis ◽  
Christos Volos ◽  
Sajad Jafari ◽  
Jesus M. Munoz-Pacheco ◽  
Jacques Kengne ◽  
...  

A modification of the classic logistic map is proposed, using fuzzy triangular numbers. The resulting map is analysed through its Lyapunov exponent (LE) and bifurcation diagrams. It shows higher complexity compared to the classic logistic map and showcases phenomena, like antimonotonicity and crisis. The map is then applied to the problem of pseudo random bit generation, using a simple rule to generate the bit sequence. The resulting random bit generator (RBG) successfully passes the National Institute of Standards and Technology (NIST) statistical tests, and it is then successfully applied to the problem of image encryption.


2020 ◽  
Vol 18 (1) ◽  
pp. 1727-1741
Author(s):  
Yoonjin Lee ◽  
Yoon Kyung Park

Abstract We study the modularity of Ramanujan’s function k ( τ ) = r ( τ ) r 2 ( 2 τ ) k(\tau )=r(\tau ){r}^{2}(2\tau ) , where r ( τ ) r(\tau ) is the Rogers-Ramanujan continued fraction. We first find the modular equation of k ( τ ) k(\tau ) of “an” level, and we obtain some symmetry relations and some congruence relations which are satisfied by the modular equations; these relations are quite useful for reduction of the computation cost for finding the modular equations. We also show that for some τ \tau in an imaginary quadratic field, the value k ( τ ) k(\tau ) generates the ray class field over an imaginary quadratic field modulo 10; this is because the function k is a generator of the field of the modular function on Γ 1 ( 10 ) {{\mathrm{\Gamma}}}_{1}(10) . Furthermore, we suggest a rather optimal way of evaluating the singular values of k ( τ ) k(\tau ) using the modular equations in the following two ways: one is that if j ( τ ) j(\tau ) is the elliptic modular function, then one can explicitly evaluate the value k ( τ ) k(\tau ) , and the other is that once the value k ( τ ) k(\tau ) is given, we can obtain the value k ( r τ ) k(r\tau ) for any positive rational number r immediately.


Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 753
Author(s):  
Ivan Chajda ◽  
Helmut Länger

In order to be able to use methods of universal algebra for investigating posets, we assigned to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset, a certain algebra (based on a commutative directoid or on a λ-lattice) which satisfies certain identities and implications. We show that the assigned algebras fully characterize the given corresponding posets. A certain kind of symmetry can be seen in the relationship between the classes of mentioned posets and the classes of directoids and λ-lattices representing these relational structures. As we show in the paper, this relationship is fully symmetric. Our results show that the assigned algebras satisfy strong congruence properties which can be transferred back to the posets. We also mention applications of such posets in certain non-classical logics.


Sign in / Sign up

Export Citation Format

Share Document