Erdős Problem #873 — Let A=a_1<a_2<…⊆ N and let F(A,X,k) count the number of i such that [a_i,a_i+1,…,a_i+k-1] < X, where the left-hand side is the least common multiple.
Statement
Let and let count the number of such that where the left-hand side is the least common multiple. Is it true that, for every , there exists some such that
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.