Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. S. A. Burr, P. Erdős, R. L. Graham and W. Wen-Ching Li, Complete sequences of sets of integer powers, Acta Arith. 77 (1996), no. 2, 133--138 (the source card is burr_1996_complete_sequences_sets_integer_powers). For a set of integers greater than , is the set of powers with and . Section 3 states the largest integer that is not a sum of distinct elements of for four sets : for , which the authors derive from the Mignotte--Waldschmidt lower bound on ; for ; for ; and for , the last offered as an example of what the authors call their "limited computational experience" with sets whose reciprocal sum exceeds . The paper prints none of the computations. Each of the four sets has (with equality for the first three) and greatest common divisor , so each is an admissible tuple of [[problems/diophantine_problems/E0124/_index|Problem 124]], and a sum of distinct elements of is a sum with , one term per base.
Covers. The second question at for the four tuples , , and : yes, every integer above the stated value is represented. Not covered: exponents and every other tuple, and the first question. The site's commentary says the authors proved the conjecture for ; the result covers only .
Depends on. No page of this wiki.
Acceptance. Refereed: Acta Arithmetica 77 (1996), no. 2, 133--138. The
site's commentary (page last edited 1 December 2025) credits the
case to this paper but labels the problem OPEN, so no reviewed evidence is
listed. The formal-conjectures statement file for the problem states the
case at as erdos124.ne_zero_three_four_seven, marked
research solved and credited to this paper, with no formal proof. The
computations were not reconstructed in this corpus.