Claims · 47 dated claims on Erdos, each with its tag and its witness; newest 2026-10-05.
Verified The two-part obstruction at twelve digits: for each of the 30 base sets in [3, 10] minimal for sigma > 1 and gcd = 1, the least sum(M_1(D) below N)/N over terms N in [10^12, 10^30] lies in [1.105953, 1.537469], truncated, so any two disjoint parts of the terms have one with Delta >= 0.23 N at that N. Witness: lab/rs/mixed-powers, verb route 10 12
Verified Erdos problem 124 at the first three levels up to base 10: every base set D in [3, 10] with sigma(D) > 1 and gcd(D) = 1 has sum_(d in D) P(d, k) cofinite for k = 1, 2, 3, by the surplus certificate on the 30 minimal base sets, 21 of them also at k = 4 and 5 at k = 5, with a 2^32-bit array per cell in 2.9 s. Witness: lab/rs/mixed-powers, verb census 10 5 32 4
Verified Erdos problem 124 at the first two levels up to base 12: every base set in [3, 12] with sigma > 1 and gcd = 1 has sum_(d in D) P(d, k) cofinite for k = 1, 2, over the 103 minimal base sets, whose sigma lies between 2311/2310 and 8/7; the last cell, {3, 6, 9, 10, 12} at k = 2, needs a 2^34-bit array and has largest non-sum 1473914231. Witness: lab/rs/mixed-powers, verbs census 12 5 32 4 and cell 3,6,9,10,12 2 34
Verified The largest integer that is no sum of distinct powers 3^j, 4^j, 5^j with j >= k is 79, 77613, 4330731, 1075364603 at k = 1, 2, 3, 4, with 11, 1128, 45704, 1785062 positive non-sums up to it; for 3^j, 4^j, 6^j it is 986, 242113, 58941162 at k = 1, 2, 3; a plain knapsack over every term up to 4 F returns the same largest non-sum and count on nine cells. Witness: lab/rs/mixed-powers, verbs census 10 5 32 4, cell 3,4,5 4 34 and control
Verified Fan 2026 Theorem 1.5, read at source, proves the set of powers of a finite D strongly complete when D splits into two parts of sigma >= 1 and one of gcd = 1, no two elements powers of one integer, and Bergelson and Simmons 2017 Theorem 1.23, read at source, the same with three parts of sigma >= 1, stating they can neither prove nor disprove the conjecture of Burr, Erdos, Graham and Li; the Erdos problem 124 page, last edited before Fan's paper, cites neither, and both theorems need sigma(D) >= 2, so no theorem whose proof is read on the page settles a base set with sigma(D) < 2; the page's credit of {3, 4, 7} to Burr, Erdos, Graham and Li rests on a paper not read. Witness: erdos.md Problem 124: what is in print
Conjecture The powers 3^j, 4^j, 5^j with j >= k are complete at every level k, the least base set outside every theorem whose proof is read on the page; checked at k <= 4. Witness: lab/rs/mixed-powers, verbs census 10 5 32 4 and cell 3,4,5 4 34
Proved The surplus certificate for Erdos problem 124, the surplus bound being the per-part computation of Fan 2026 Section 7: for a finite base set D of integers >= 3 with sigma(D) = sum 1/(d - 1) > 1 and a level k >= 1, if the sums P_n of the n least terms of the multiset M_k(D) of powers d^j, j >= k, contain every x with T <= x <= S_n/2, T - 1 is missing, T <= a_(n+1), and a_(m+1) <= S_m - 2T + 1 for every m >= n with (sigma(D) - 1) a_(m+1) < C_k(D) + 2T - 1, C_k(D) = sum d^k/(d - 1), then every integer >= T is a sum of distinct terms and T - 1 is the largest that is not. Witness: erdos.md The surplus certificate, "Proved (the certificate)"
Proved Exact in the gap: when 1 < sigma(D) < 2, M_k(D) is complete if and only if the surplus certificate exists at some n, so the certificate search halts exactly on the complete levels and returns the largest non-sum; the proof takes Dirichlet scales N where every base has its least power >= N in [N, beta N), sigma(D) beta < 2. Witness: erdos.md The surplus certificate, "Proved (exact in the gap)"
Proved Completeness of M_k(D) passes to every base set containing D and every level below k. Witness: erdos.md The surplus certificate, "Proved (monotone)"
Proved The two-part route is dead below two: for finite D with sigma(D) < 2 and any k >= 0, no two disjoint infinite sub-multisets of M_k(D) both have Delta(B) = sup_(b in B) (b - sum_(b' in B, b' < b) b') finite, so the criteria of Fan 2026 Theorem 2.2 (two such parts) and Bergelson and Simmons 2017 Theorem 2.1 (three) apply to no M_k(D) with sigma(D) < 2 under any partition of the terms, while the whole of M_k(D) has Delta <= C_k(D) once sigma(D) >= 1. Witness: erdos.md The two-part route is dead below two
Proved Bergelson and Simmons 2017 Main Theorem 2.1, read literally without infinite parts B_1, B_2, B_3, fails: at D = {5, 6}, k = 1, the parts {5}, {6}, {25} have Delta finite, the remaining powers meet the divergence and residue conditions, and the sums of distinct powers number at most x^(log_5 2 + log_6 2) < x^0.82 up to x; its proof and Fan 2026 Theorem 2.2 use infinite parts. Witness: erdos.md Problem 124: what is in print
Verified Sets and multisets differ on Erdos problem 124 where two bases are powers of one integer: the powers of {3, 5, 6, 9} from k = 1 have largest non-sum 22 as the multiset of the site's question, while as a set of powers 649 is no sum and every integer from 650 to 2 10^4 is. Witness: lab/rs/mixed-powers, verbs cell 3,5,6,9 1 20 and set 3,5,6,9 1 20000
Verified Fan 2026 Theorem 1.5 needs sigma(D) > 2, its third part being nonempty with gcd = 1, and Bergelson and Simmons 2017 Theorem 1.23 needs sigma(D) > 3; the surplus computation behind the certificate first appears in Bergelson and Simmons Section 2.7, read at source. Witness: erdos.md Problem 124: what is in print
Verified The seed: the 33 terms of floor(2 (5/3)^n) up to 2^26 open 31 windows a_(n+2) > S_n and every one holds a non-sum; the largest non-sum up to 2^25 is 23559582. Witness: lab/rs/mixed-powers, verb graham 2 5 3 26
Verified The power multisets run no window chain in [10^6, 10^30]: M_k({3, 4, 5}) opens a window at 27 of 123 terms at each k = 1..4, M_1({3, 4, 6}) at 41 of 120, M_1({3, 5, 6, 7}) at 5 of 142, and in none of the six does an upper window (S_m, a_(m+2)) meet the lower window (S_n - a_(n+1), a_(n+2) - a_(n+1)) of a later window. Witness: lab/rs/mixed-powers, verb windows
Verified The certificate for {3, 4, 5} at k = 5 does not fit a 2^34-bit array; the base interval sits at the term a_n = 243, 177147, 9765625, 3486784401 at k = 1..4. Witness: lab/rs/mixed-powers, verbs census 10 5 32 4, cell 3,4,5 4 34 and cell 3,4,5 5 34
Refuted L, the statement that every multiset with linear surplus, S_n - a_(n+1) >= eps a_(n+1) - C for some eps > 0 and a constant C, and H_1(M) = {theta in R/Z : sum_(a in M) norm(a theta) < infinity} = {0} is complete, which would have settled Erdos problem 124 above sigma = 1. Witness: A = {2 F_m - 1 : m >= 2} = 1, 3, 5, 9, 15, 25, 41, ..., a_(n+1) = a_n + a_(n-1) + 1, has S_n - a_(n+1) = a_n - n - 2, H_1(A) = {0} since norm(theta) <= norm(a_(n+1) theta) + norm(a_n theta) + norm(a_(n-1) theta), and windows a_(n+2) - S_n = n + 3 that nest from step to step two later, carrying the non-sum 2 into every window; the 38 terms to 2^27 open 36 windows, all holding a non-sum, and the non-sums below 10^6 are the chains 2, 7, 22, 63, ... and 2, 11, 36, 103, .... Witness: erdos.md The missing lemma, and lab/rs/mixed-powers, verb refute 27
Proved The window: for a sorted multiset with a_(n+2) > S_n, the sums in (S_n, a_(n+2)) are exactly a_(n+1) plus the sums of the first n terms in (S_n - a_(n+1), a_(n+2) - a_(n+1)), so an integer of the lower window missing from the sums of the first n terms is carried to a non-sum in the upper one. Witness: erdos.md The missing lemma, "Proved (the window)"
Proved Surplus does not heal: the set floor(2 (5/3)^n), n >= 1, has S_n - a_(n+1) >= a_(n+1)/2 - n - 5, linear surplus since a_(n+1) grows geometrically, and is incomplete, its windows opening at every n and each upper window (S_(n-2), a_n) lying inside the lower window of step n from n = 4 on, so one non-sum in a window recurs in every other window; this reproves at one point the incompleteness of Graham for t > 1, alpha >= max(2/t, phi), quoted in Fan 2026. Witness: erdos.md The missing lemma, "Proved (surplus does not heal)"
Verifiedg_3(n) = 1, 3, 8, 22, 60, 168 at n = 1..6 for Erdos problem 817, recomputed by an exhaustive top-down search over sets with distinct ternary sums, pruned by the previous values and by sum a_i^2 >= (9^n - 1)/8; the witness at n = 6 is {107, 145, 159, 162, 164, 168}, a second extremal set beside the discussion thread's {107, 145, 159, 162, 166, 168}. Witness: lab/rs/mixed-powers, verb ternary 6 200 8
Verifiedg_3(7) <= 474, past the 504 on the Erdos problem 817 thread: {302, 409, 447, 459, 465, 466, 474} has 2187 distinct ternary sums and its 128 subset sums hold no non-trivial 3-term progression, checked from the definition; with g_3(n + 1) <= 3 g_3(n) this gives g_3(n)/3^n < 0.216736 for every n >= 7, against the thread's 0.2305. Witness: lab/rs/mixed-powers, verb band 419 475 70 8, and the crate test on the set
Verified No admissible 7-set for Erdos problem 817 with largest element N in [419, 473] has its six largest elements in [N - 100, N], so a set beating 474 has its second-smallest element below N - 100. Witness: lab/rs/mixed-powers, verb band 419 473 100 8
Proved The two routes: for a sorted multiset, an integer x with a_(n+1) <= x < a_(n+2) is no sum exactly when x - a_(n+1) and S_n - x are both missing from the sums of the first n terms, a negative value counting as missing; the window route is S_n - x < 0, and the pair route splits S_n - a_(n+1) into two integers of [0, S_n] missing from those sums and needs no window. Witness: erdos.md The two routes, "Proved (the two routes)"
Refuted The chain-excluded lemma, that linear surplus, H_1(M) = {0} and, for all large m < n, the upper window (S_m, a_(m+2)) disjoint from the lower window (S_n - a_(n+1), a_(n+2) - a_(n+1)) make a multiset complete. Witness: a_1, a_2, a_3 = 4, 5, 6 and a_(n+2) = S_n - y_n - y_(n+1) for n >= 2, y_n = 2 - (floor(n/2) mod 2), opens no window from n = 2 on, has linear surplus with eps = 1/2 and H_1 = {0}, and misses a_(n+1) + y_n for every n >= 3, each by the pair route; E is no power multiset M_k(D) and meets the chain clause vacuously, opening no window from n = 2 on; the lemma with windows required to open infinitely often is not reached. erdos.md The two routes, "Refuted"
Verified The multiset 4, 5, 6, 7, 12, 18, 31, 50, 80, 129, ... with a_(n+2) = S_n - y_n - y_(n+1), y_n = 2 - (floor(n/2) mod 2): its 38 terms up to 2^27 open no window at n >= 2, the least of 2 (S_n - a_(n+1)) - a_(n+1) over n >= 1 is -7, a_(n+3) - a_(n+2) - a_(n+1) takes only -1 and 1 for n >= 2, the 34 values a_(n+1) + y_n with 3 <= n <= 36, those below the last term, are non-sums, and of the 38 non-sums below the last term 3 lie below a_1 and 35 come by the pair route, none by the window route. Witness: lab/rs/mixed-powers, verb chainless 27 and its crate test
Proved The wide certificate: with B_n the sums of the first n terms in [0, W] and H_n the integers of (W, S_n/2] missing from them, B_(n+1) = B_n U ((B_n meet [0, W - a_(n+1)]) + a_(n+1)), and the integers of (W, S_(n+1)/2] missing at step n + 1 are the members of H_n, S_n - H_n, S_n - ([0, W] minus B_n) and (S_n, S_(n+1)/2] whose difference with a_(n+1) is missing at step n. Witness: erdos.md The surplus certificate, "Proved (the wide certificate)"
Verified On the 109 cells of minimal base sets in [3, 10] at k <= 4 that the full surplus certificate settles within 2^30 bits, the wide certificate at W = 2^16 returns the same F, count of non-sums, index, S_n and takeover term in every cell, 59 of them with S_n > 2^17. Witness: lab/rs/mixed-powers, verb wcontrol 16
Verified Every base set D in [3, 10] with sigma(D) > 1 and gcd(D) = 1 has sum_i P(d_i, k) cofinite for k = 1, 2, 3, 4: all 30 minimal base sets are certified at k = 4 as the multiset M_k(D). Witness: lab/rs/mixed-powers, verb deep 10 6 31 4
Verified28 of the 30 minimal base sets in [3, 10] are certified at k = 5, 23 at W = 2^31, {3, 4, 8, 9}, {3, 5, 7, 9}, {3, 4, 9, 10} at W = 2^33 and {3, 5, 6, 9}, {3, 6, 8, 9, 10} at W = 2^34; {3, 5, 6, 7} and {4, 5, 6, 7, 9} are certified at k = 6; {3, 4, 6} and {3, 5, 8, 9} at k = 5 and {3, 4, 5} at k = 6 are not certified within W = 2^34 and a list of 2^25 holes. Witness: lab/rs/mixed-powers, verbs deep 10 6 31 4 and wcell
VerifiedF({3, 4, 5}, 5) = 31333640736, with 100335626 positive integers up to F that are no sum of M_5({3, 4, 5}), the certificate closing at a_n = 2^36 with S_n = 176844529807, the step holding until the surplus takes over at 5^17 = 762939453125; a meet in the middle over the 41 terms up to F + 63, independent of the bit array, finds F the only non-sum in [F, F + 63]. Witness: lab/rs/mixed-powers, verbs deep 10 6 31 4 and split 3,4,5 5 31333640736 64
VerifiedF({3, 4, 6}, 4) = 14059625243, with 21808124 positive non-sums up to F. Witness: lab/rs/mixed-powers, verbs deep 10 6 31 4 and wcell 3,4,6 4 33
Verified Over the 30 minimal base sets in [3, 10], F(D, k) comes by the window route in 7 cells at k = 1, 1 at k = 2, 2 at k = 3, and by the pair route in every certified cell from k = 4 on, 30 at k = 4, 28 at k = 5, 2 at k = 6; at k = 4 the pair route carries 128689970 non-sums against 9859830 by the window route. Witness: lab/rs/mixed-powers, verbs deep 10 6 31 4 and wcell
Verified The 103 minimal base sets in [3, 12] all certify at k = 2 in one run at W = 2^31 and 101 certify at k = 3; {3, 6, 8, 9, 12} and {3, 6, 9, 10, 12} are not certified at k = 3 within W = 2^33. Witness: lab/rs/mixed-powers, verbs deep 12 3 31 4 and wcell
Proved If 1 < sigma(D) < 2, then M_k(D) is complete exactly when some n has 2 T_n - 1 <= (sigma(D) - 1) a_(n+1) - C_k(D), with T_n = 1 + max{x <= S_n/2 : x not in P_n}. Witness: erdos.md What stays open, "Proved (the target as one inequality)"
ConjectureM_k({3, 4, 5}) is complete at every k; certified at k <= 5 with no derivation. Witness: lab/rs/mixed-powers, verb deep 10 6 31 4
Proved The chain: for a sorted multiset with a_(n+2) = S_n - u_n - u_(n+1) for every n >= n_0, each u_(n+1) negative or a positive integer missing from the sums P_(n+1) of the first n + 1 terms, and x_n = a_(n+1) + u_n in [0, S_(n+1)], if x_(n_0) is missing from P_(n_0 + 1) then every x_n, n >= n_0, is missing from P_(n+1), and is no sum whenever x_n < a_(n+2); a window opens at n exactly when u_n + u_(n+1) < 0. Witness: erdos.md The windowed lemma, "Proved (the chain)"
Refuted The windowed lemma, that linear surplus, H_1(M) = {0}, windows a_(n+2) > S_n infinitely often, and for all large m < n the upper window (S_m, a_(m+2)) disjoint from the lower window (S_n - a_(n+1), a_(n+2) - a_(n+1)) make a multiset complete. Witness: V = 4, 5, 6, 7, 13, ..., a_(n+2) = S_n - u_n - u_(n+1) for n >= 2 with u_n = 2, -x_(n-2), x_(n-3) at n = 0, 1, 2 mod 5 from n = 5, 6, 7 and 1 otherwise, x_n = a_(n+1) + u_n, opens a window of width at least (a_(n+2) - 5)/4 at every n = 0 mod 5, has no chain, has 12 (S_n - a_(n+1)) >= a_(n+1) - 2 for n >= 3 and H_1 = {0}, misses every x_n, n >= 3, and is no power multiset. erdos.md The windowed lemma, "Refuted"
Verified The multiset V of the windowed lemma up to 2^27: 37 terms, sorted, 7 windows from n = 2 on, exactly at n = 5, 10, ..., 35, the least width over the term 0.255, truncated, no chained pair, every window holding a non-sum; the least of 12 (S_n - a_(n+1)) - a_(n+1) over n >= 3 is 37; a_(n+3) - a_(n+2) - a_(n+1) = -1 at every n = 3 mod 5 from 3; the 33 values x_n, n >= 3, below a_(n+2) are non-sums; of the 1352 non-sums below the last term 3 lie below a_1, 494 come by the window route and 855 by the pair route. Witness: lab/rs/mixed-powers, verb windowed 27 and its crate test
Proved The birth law: for a sorted multiset with sums P_n of the first n terms, an integer x with S_n/2 < x <= S_(n+1)/2 is missing from P_(n+1) exactly when x = S_n - g with g missing from P_n, S_n - a_(n+1) <= 2g < S_n, and S_n - a_(n+1) - g missing from P_n, a negative value counting as missing; every integer of [0, S_n/2] missing from P_(n+1) is missing from P_n. Witness: erdos.md The deepest hole, "Proved (the birth law)"
Proved The jump: with T_n = 1 + max{x <= S_n/2 : x not in P_n} and R_n = S_n - a_(n+1), if T_(n+1) > T_n then S_n - T_n + 2 <= T_(n+1) <= S_(n+1)/2 + 1, R_n <= 2 T_n - 2 and R_(n+1) <= 2 T_(n+1) - 2; if R_n < T_n - 1 < S_n/2 then T_(n+1) > T_n; so the surplus certificate for Erdos problem 124 closes at least two steps after the last rise of T. Witness: erdos.md The deepest hole, "Proved (the jump)" and "Proved (after a rise)"
Proved The route of the largest non-sum: if M_k(D) is complete and F = F(D, k) is born at the step b with S_b < 2F <= S_(b+1), then F >= a_(b+1) makes F come by the pair route, and a window-route F has F < a_(b+1) and T_b - 1 > S_b - a_(b+1). Witness: erdos.md The deepest hole, "Proved (the route of F)"
Verified On every step of the 173 cells the run reaches, each minimal base set in [3, 10] from k = 1 up to its first level capped at W = 2^31, at most 6, the jump law holds; over the 145 certified cells F >= a_(b+1) at its birth step in 17, 27, 27, 26, 22, 2 cells at k = 1..6, F comes by the window route in 7, 1, 2, 0, 0, 0, each with T_b - 1 > S_b - a_(b+1), F is born at the last rise of T in 111, and the certificate closes 2 to 6 steps after the last rise. Witness: lab/rs/mixed-powers, verb jumps 10 6 31 4
Verified After the last base of D enters, T_n/a_(n+1) peaks at 1.9430 over the certified cells of the minimal base sets in [3, 10], at {3, 6, 7, 9, 10}, k = 5, and reaches 1.1727 or more in every certified cell with k >= 2; each of the 28 capped cells the run reaches, {3, 4, 5} at k = 6 among them, has all its rises of T in one run open at the cap, of 28 to 37 rises. Witness: lab/rs/mixed-powers, verb jumps 10 6 31 4
Verified Burr, Erdos, Graham and Li 1996, read at source, state the conjecture for Pow(A; s), the nondecreasing sequence formed from all a^k, a in A, k >= s >= 1, which, called nondecreasing, reads as the multiset M_s(A), though Claim 1 writes it strictly increasing; they state, without printing the argument, that the bound of Mignotte and Waldschmidt on abs(3^p - 4^q) lets them show {3, 4, 7} complete at s = 1, largest missing integer 581; and their Theorem 1 gives, for A of positive upper density with gcd = 1, a finite A' in A with Pow(A'; s) complete. Witness: erdos.md Problem 124: what is in print
Verified Burr, Erdos, Graham and Li 1996 print 111, 16 and 78 as the largest integers missing from the sums of Pow(A; 1) for A = {3, 5, 7, 13}, {3, 6, 7, 13, 21} and {3, 4, 5}; a plain knapsack reads 112, 17 and 79 as the largest non-sums below its bound, and 111 = 81 + 27 + 3, 16 = 9 + 7 and 78 = 64 + 9 + 5 are sums, so each printed value is one short; their 581 for {3, 4, 7} agrees, and 79 is also the surplus certificate's F({3, 4, 5}, 1). Witness: lab/rs/mixed-powers, verb set at 3,5,7,13 1 2000000, 3,6,7,13,21 1 2000000, 3,4,7 1 2000000 and 3,4,5 1 100000
Refuted Cross-reference to the chain-excluded row, whose witness says the lemma with windows required to open infinitely often is not reached: that lemma, the windowed lemma, is refuted by the multiset V of erdos.md, whose windows open at every n = 0 mod 5 from n = 5, with no chain, linear surplus and H_1 = {0}, and which misses every x_n, n >= 3. Witness: erdos.md The windowed lemma, "Refuted"
Verified Cross-reference to the row on Fan 2026 and Bergelson and Simmons 2017, which says the page's credit of {3, 4, 7} to Burr, Erdos, Graham and Li rests on a paper not read: the paper, read at source, states without printing the argument that the bound of Mignotte and Waldschmidt on abs(3^p - 4^q) lets them show {3, 4, 7} complete at s = 1, largest missing integer 581, so the credit rests on an argument at the one level k = 1 that the paper states but does not print. Witness: erdos.md Problem 124: what is in print