How Often is n! a Sum of Three Squares?

Jean-Marc Deshouillers () and Florian Luca ()
Additional contact information
Jean-Marc Deshouillers: Université de Bordeaux et CNRS, IMB
Florian Luca: Universidad Nacional Autónoma de México, Instituto de Matemáticas

A chapter in The Legacy of Alladi Ramakrishnan in the Mathematical Sciences, 2010, pp 243-251 from Springer

Abstract: Summary The positive integers n such that n! is a sum of three squares have a density which is equal to 7 ∕ 8. The key point for the proof of this result is to show that the above sequence is automatic and to study the matrix associated to the underlying automaton.

Keywords: Automatic sequences; Sums of three squares; Density of sequences (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4419-6263-8_14

Ordering information: This item can be ordered from
http://www.springer.com/9781441962638

DOI: 10.1007/978-1-4419-6263-8_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().