Erdős Problem #696
Statement
Let be the largest such that there is a sequence of primes all dividing with . Let be the largest such that there is a sequence of integers all dividing with . Estimate and . Is it true that for almost all ?
Record
- Source
- Added
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.