English

Factorial residues modulo a prime: beyond the square-root bound

Number Theory 2026-08-03 v1 Combinatorics

Abstract

For a prime pp, let Ap={k!(modp):1k<p}A_p=\{k!\pmod p:1\leq k<p\}. We prove App8/15|A_p|\gg p^{8/15}, improving the general lower bound (2o(1))p1/2(\sqrt{2}-o(1))p^{1/2}. The proof begins with the identity (n+2)!=(n+1)!+((n+1)!)2/n!(n+2)!=(n+1)!+((n+1)!)^2/n! in Fp\mathbb{F}_p, which produces many incidences for a family of fractional-linear maps. After Cauchy--Schwarz, the transition maps between two members of this family become affine lines, with multiplicity at most two. The Cartesian-product point-line incidence theorem of Stevens and de Zeeuw then yields the exponent 8/158/15.

Cite

@article{arxiv.2608.01781,
  title  = {Factorial residues modulo a prime: beyond the square-root bound},
  author = {Xiyu Hu},
  journal= {arXiv preprint arXiv:2608.01781},
  year   = {2026}
}

Comments

6 pages, 1 figure. Comments welcome