Erdős Problem #430
Statement
Fix some integer and define a decreasing sequence in by and, for , letting be the greatest integer in such that all of the prime factors of are . Is it true that, for sufficiently large , not all of this sequence can be prime?
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.