Erdős Problem #459 — Given u, let v = f(u) be the largest integer such that no m ∈ (u, v) is composed entirely of primes dividing uv.
Statement
Given , let be the largest integer such that no is composed entirely of primes dividing . Estimate .
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.