Erdős Problem #478 — Factorial residues modulo primes
For each prime , let be the field with elements and define the set of factorial residues
Is it true, as tends to infinity through the primes, that
equivalently, that ? Erdős Problem #478 Factorial Residues Modulo a Prime: Beyond the Square-Root Bound
Background
Erdős and Graham posed the question in their 1980 book. The constant is suggested by an occupancy heuristic: if the factorials behaved like independent uniform choices from residues, the expected number of residues hit would be . This models the proposed density but does not account for the dependencies among factorial residues. Erdős Problem #478 Factorial Residues Modulo a Prime: Beyond the Square-Root Bound
A basic source of information is the ratio of consecutive factorials: in . Together with , this gives , and hence . Wilson's theorem also gives . For , this repeats the value at a distinct index, so ; this bound does not hold for , where . Erdős Problem #478 Factorial Residues Modulo a Prime: Beyond the Square-Root Bound
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.