Erdős Problem #430 — Fix some integer n and define a decreasing sequence in [1,n) by a_1=n-1 and, for k≥ 2, letting a_k be the greatest integer in [1,a_k-1) such that all of the prime factors of a_k are…
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
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.