ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let x∈Nx\in\mathbb N. Choose a1,a2,…a_1,a_2,\ldots independently and uniformly from {1,…,x}\{1,\ldots,x\}, and define

T(x):=min⁡{N∈N:∏i∈Iai is a perfect square for some nonempty I⊆{1,…,N}}.T(x):=\min\left\{N\in\mathbb N:\prod_{i\in I}a_i\text{ is a perfect square for some nonempty }I\subseteq\{1,\ldots,N\}\right\}.

Let π(y)\pi(y) be the number of primes at most yy, let Ψ(x,y)\Psi(x,y) be the number of integers in {1,…,x}\{1,\ldots,x\} having no prime factor greater than yy, and define

J(x):=min⁡2≤y≤xπ(y)xΨ(x,y).J(x):=\min_{2\le y\le x}\frac{\pi(y)x}{\Psi(x,y)}.

Then, for every ε>0\varepsilon>0, with probability tending to 11 as x→∞x\to\infty,

(e−γ−ε)J(x)≤T(x)≤(e−γ+ε)J(x),\bigl(e^{-\gamma}-\varepsilon\bigr)J(x)\le T(x)\le\bigl(e^{-\gamma}+\varepsilon\bigr)J(x),

where γ\gamma is the Euler–Mascheroni constant. Thus the previously conjectured sharp threshold is proved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.