The Ford-type conjecture on gaps between integers with restricted factors
Statement
Fix and with . Consider a sequence of consecutive natural numbers in such that, for every , for any .
Restricted-factor gap conjecture. The length of is at most of order for some fixed .
The source contrasts this proposed upper bound with an available lower bound and a much larger elementary upper bound; no resolution is reported.
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.