ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C≥1C\geq 1 be an arbitrary constant, and let kk be a positive integer. For integers xx and yy, consider the least common multiples of the consecutive integer sets

lcm⁡{x,x+1,…,x+k−1}\operatorname{lcm}\{x,x+1,\ldots,x+k-1\}

and

lcm⁡{y,y+1,…,y+k+C−1}.\operatorname{lcm}\{y,y+1,\ldots,y+k+C-1\}.

Erdős's stronger conjecture. There exist integers kk and 0<x<y0<x<y with y>x+ky>x+k such that

lcm⁡{x,x+1,…,x+k−1}>lcm⁡{y,y+1,…,y+k+C−1}.\operatorname{lcm}\{x,x+1,\ldots,x+k-1\}>\operatorname{lcm}\{y,y+1,\ldots,y+k+C-1\}.

The conjecture strengthens the proved result by requiring the comparison to hold for an arbitrary fixed CC while asserting the existence of a suitable kk, rather than allowing an arbitrary multiplicative factor on the right-hand side. The supplied source does not establish this stronger form; the stated reduction is proved, but the conjecture itself remains unresolved in the provided text.

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.