Factorials and Legendre's three-square theorem
Abstract
We provide a necessary and sufficient condition for n! to be a sum of three squares. The condition is based on the binary representation of n and can be expressed by the operation of an automaton.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.