Pomerance's eγJ0(x)e^{-\gamma}J_0(x) threshold conjecture

Let a1,a2,a_1,a_2,\ldots be independent uniform random integers in {1,,x}\{1,\ldots,x\}, and let TT be the least tt such that some subsequence of a1,,ata_1,\ldots,a_t has product equal to a square. Let π(y)\pi(y) count the primes up to yy, let Ψ(x,y)\Psi(x,y) count the yy-smooth integers up to xx, choose y0=y0(x)y_0=y_0(x) maximizing Ψ(x,y)/y\Psi(x,y)/y, and define

J0(x):=π(y0)Ψ(x,y0)x.J_0(x):=\frac{\pi(y_0)}{\Psi(x,y_0)}x.

Let γ=0.577\gamma=0.577\ldots be the Euler–Mascheroni constant. Pomerance's threshold conjecture. For every ϵ>0\epsilon>0,

Prob(T[(eγϵ)J0(x),(eγ+ϵ)J0(x)])=1o(1)\operatorname{Prob}\bigl(T\in[(e^{-\gamma}-\epsilon)J_0(x),(e^{-\gamma}+\epsilon)J_0(x)]\bigr)=1-o(1)

as xx\to\infty. Thus the conjectured sharp threshold is centered at eγJ0(x)e^{-\gamma}J_0(x). The source presents this as the authors' belief and does not give a proof or resolution.

Sources & referencesView supporting material

Primary source

Ernie Croot, Andrew Granville, Robin Pemantle and Prasad Tetali, “Sharp Transitions in Making Squares”, arXiv:0811.0372 (2008).

Progress summary

Never refreshed

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.