ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let 0<α≤1/20<\alpha\leq1/2 and let XX be a sufficiently large integer. Given constants 0<c1<c2≤10<c_1<c_2\leq1, consider the least LL such that [X−L,X][X-L,X] contains an integer divisible by some integer in [c1Xα,c2Xα][c_1X^\alpha,c_2X^\alpha].

Almost-divisibility conjecture. For every ϵ>0\epsilon>0, one can take L=XϵL=X^\epsilon provided XX is sufficiently large in terms of ϵ\epsilon.

This asks whether every sufficiently large endpoint can be approximated within an arbitrarily small power error by an integer having a divisor in the specified interval. The supplied text presents this as a suspicion and gives no resolution.

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.