
A recent conjecture is proved asserting that \(2, 5\), and \(34\) are the only Fibonacci numbers that are of the form \(n! + n(n+1)/2\) for some integer \(n\). The main tool to prove it is an upper bound for a non-zero \(p\)-adic linear form in two logarithms of algebraic numbers. Computer checking (some brief and some extensive) is indispensable for the proof.
\(p\)-adic linear forms in logarithms of algebraic numbers, Fibonacci and Lucas numbers and polynomials and generalizations, Fibonacci numbers, factoriangular numbers
\(p\)-adic linear forms in logarithms of algebraic numbers, Fibonacci and Lucas numbers and polynomials and generalizations, Fibonacci numbers, factoriangular numbers
| 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). | 4 | |
| 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 |
