Diego Marques
Notes on Number Theory and Discrete Mathematics, ISSN 1310-5132
Volume 18, 2012, Number 3, Pages 13—19
Download full paper: PDF, 166 Kb
Details
Authors and affiliations
Diego Marques
Department de Mathemática, Universidade de Brasília
Brasília, DF Brazil
Abstract
Let (Fn)n≥0 be the Fibonacci sequence given by F0 = 0; F1 = 1 and Fn+2 = Fn+1 + Fn, for n ≥ 0. In this note, we find all solutions of the Diophantine equation m1! … mk! ± 1 = Fm, where 2 ≤ m1 ≤ … ≤ mk and m ≥ 3.
Keywords
- Diophantine equation
- Factorial
- Fibonacci
- Brocard—Ramanujan
AMS Classification
- Primary: 11Dxx
- Secondary: 11B39
References
- Berman, G., K. D. Fryer, Introduction to Combinatorics, Academic Press, New York, 1972.
- Berndt, B. C.,W. Galway, The Brocard—Ramanujan diophantine equation n!+1 = m2, The Ramanujan J., Vol. 4, 2000, 41–42.
- Bilu, Yu., G. Hanrot, P. Voutier, Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte), J. reine angew. Math., Vol. 539, 2001, 75–122.
- Bollman, M., H. S. Hernández, F. Luca, Fibonacci numbers which are sums of three factorials. Publ. Math. Debrecen, Vol. 77, 2010, No. 1-2, 211–224.
- Brocard, H., Question 166, Nouv. Corresp. Math., Vol. 2, 1876, 287.
- Bugeaud, Y., M. Mignotte, S. Siksek, Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas powers, Annals of Math., Vol. 163, 2006, 969–1018.
- Bugeaud, Y., M. Mignotte, F. Luca, S. Siksek, Fibonacci numbers at most one away from a perfect power, Elem. Math., Vol. 63, 2008, 65–75.
- Erdös, P., J. L. Selfridge, The product of consecutive integers is never a power. Illinois J. Math., Vol. 19, 1975, 292–301.
- Grossman, G., F. Luca, Sums of factorials in binary recurrence sequences, J. Number Theory, Vol. 93, 2002, No. 2, 87–107.
- Luca, F., Products of factorials in binary recurrence sequences. Rocky Mountain J. Math., Vol. 29, 1999, No. 4, 1387–1411.
- Luca, F., S. Siksek, Factorials expressible as sums of at most three Fibonacci numbers, Proc. of the Edinburgh Math. Soc., Vol. 53, 2010, No. 3, 679–729.
- Luca, F., P. Stǎnicǎ, F1F2F3F4F5F6F8F10F12 = 11!, Port. Math., Vol. 63, 2006, 251–260.
- Marques, D., The Fibonacci version of the Brocard—Ramanujan Diophantine equation, Port. Math., Vol. 68, 2011, 185–189.
- Marques, D., The Fibonacci version of a variant of the Brocard—Ramanujan Diophantine equation, Far East Journal of Mathematical Sciences, Vol. 56, 2011, 219–224.
- Marques, D., A. Togbé, Perfect powers among Fibonomial coefficients, C. R. Acad. Sci. Paris, Ser. I, Vol. 348, 2010, 717–720.
- Overholt, M., The Diophantine Equation n!+1 = m2, Bulletin London Math. Soc., Vol. 25, 1993, 104.
- Ramanujan, S., Question 469, J. Indian Math. Soc., Vol. 5, 1913, 59.
- Ramanujan, S., Collected Papers, Chelsea, New York, 1962.
- Sun, Z. W., Mixed sums of primes and other terms, arXiv:0901.3075v3
Related papers
Cite this paper
Marques, D. (2012). Fibonacci numbers at most one away from a product of factorials, Notes on Number Theory and Discrete Mathematics, 18(3), 13-19.