Erdős Problem #458 — Denote by A_n the least common multiple of the integers 1, 2, ..., n and let p_k denote the k^th prime.
Statement
Denote by the least common multiple of the integers and let denote the prime. Almost certainly must hold for every but the proof of this is certainly beyond our ability [...]. In fact, if denotes the least common multiple of the numbers with then seems extremely unlikely to us.
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.