Erdős Problem #413
Statement
Let count the number of distinct primes dividing . Are there infinitely many such that, for all , we have ? Can one show that there exists an such that there are infinitely many where for 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.