Downloads provided by UsageCounts
In [R. K. Guy, Unsolved Problems in Number Theory, 3rd ed. Springer Verlag, New York, 2004, D23], it is stated that Sierpinski asked the question of whether or not there exist four (distinct) triangular numbers in geometric progression. Szymiczek conjectured that the answer is negative. Recently M. A. Bennett [Integers: Electronic Journal of Combinatorial Number Theory 5(1) (2005)] proved that there do not exist four distinct triangular numbers in geometric progression with the common ratio being a positive integer. In this paper we prove that there do not exist four distinct triangular numbers in geometric progression. Thus Sierpinski’s question is answered and Szymiczek’s conjecture is confirmed.
Binomial coefficients; factorials; \(q\)-identities, triangular numbers, Quadratic and bilinear Diophantine equations
Binomial coefficients; factorials; \(q\)-identities, triangular numbers, Quadratic and bilinear Diophantine equations
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 4 | |
| downloads | 5 |

Views provided by UsageCounts
Downloads provided by UsageCounts