Equidistribution conjecture for fractional parts of factorial roots

From papers

For a positive integer AA, let

S={a!kmod1:2aA, 2k5loglogA},S=\left\{\sqrt[k]{a!}\bmod 1:2\leq a\leq A,\ 2\leq k\leq5\log\log A\right\},

where the set is counted as a multiset when cardinalities are computed. Equidistribution conjecture. For any interval I[0,1]I\subset[0,1],

SI=SI+O(S1ϵ)|S\cap I|=|S|\,|I|+O\left(|S|^{1-\epsilon}\right)

for some positive ϵ>0\epsilon>0 as AA\to\infty. Such an estimate would provide the equidistribution needed to prove that the set of integers aa participating in solutions to a!b!=c!a!b!=c! has asymptotic density zero. The conjecture is not resolved in the source.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Joshua Cooper and Joseph Preuss, “On the sparsity of integers a in solutions to a!b!=c!”, arXiv:2512.03188 (2025).

Solutions 0

No solutions have been posted yet.