Hostname: page-component-7dd5485656-2pp2p Total loading time: 0 Render date: 2025-10-31T21:52:39.045Z Has data issue: false hasContentIssue false
  • English
  • Français

98.01 On Fibonacci numbers that are factorials

Published online by Cambridge University Press:  23 January 2015

Surajit Rajagopal  and
Martin Griffiths
Surajit Rajagopal
Affiliation:
401 Devaarti Building, Mahim West, Mumbai 400016, India
Martin Griffiths
Affiliation:
Christ's College, 33 Rolleston A venue, Christchurch 8013, New Zealand
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Notes
Information
The Mathematical Gazette , Volume 98 , Issue 541 , March 2014 , pp. 104 - 107
Copyright
Copyright © The Mathematical Association 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1. Cohn, J. H. E., Square Fibonacci numbers, Fibonacci Quarterly 2:2 (1964), pp. 109–113.Google Scholar
2. Jaroma, J. H., The imperfect Fibonacci and Lucas numbers, Irish Mathematical Society Bulletin 63 (2009), pp. 33–43.CrossRefGoogle Scholar
3. Luca, F., Perfect Fibonacci and Lucas numbers, Rend. Cir. Mat. Palermo (Serie II) XLIX (2000), pp. 313–318.Google Scholar
4. Luca, F. and Siksek, S., On factorials expressible as sums of at most three Fibonacci numbers, Proceedings of the Edinburgh Mathematical Society 53 (2010), pp. 747–763.Google Scholar
5. Hardy, G. H. and Wright, E. M., An Introduction to the Theory of Numbers (6th ed.), Oxford University Press (2008).Google Scholar
6. Griffiths, M., But which one is it? Math. Gaz. 87 (November 2003), pp. 491–492.Google Scholar
7. Carmichael, R. D., On the numerical factors of the arithmetic forms αn ± βn , Annals of Mathematics 15:1 (1913), pp. 30–70.CrossRefGoogle Scholar
8. ‘Carmichael's theorem’, http://en.wikipedia.org/wiki/Carmichael's_theorem Google Scholar
9. Yabuta, M., A simple proof of Carmichael's theorem on primitive divisors, Fibonacci Quarterly 39:5 (2001), pp. 439–443.Google Scholar
10. Burton, D. M., Elementary Number Theory, McGraw-Hill, 1998.Google Scholar