Factorial residues modulo a prime: beyond the square-root bound
Number Theory
2026-08-03 v1 Combinatorics
Abstract
For a prime , let . We prove , improving the general lower bound . The proof begins with the identity in , 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 .
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