Erdős Problem #679
Statement
Let and count the number of distinct prime factors of . Are there infinitely many values of such that for all which are sufficiently large depending on only? Can one show the stronger version with is false?
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.