Almost-divisibility conjecture for integers in a power interval
Statement
Let and let be a sufficiently large integer. Given constants , consider the least such that contains an integer divisible by some integer in .
Almost-divisibility conjecture. For every , one can take provided is sufficiently large in terms of .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.