Claims

../

1996_04_01_erdos_lewin: Erdős and Lewin's refereed proof (Math. Comp. 1996) that the products of powers of 2, 5 and p are d-complete for each prime p from 7 to 19, and those of 3, 5 and 7 as well: the problem's first settled cases.

2016_02_03_ma_chen: Ma and Chen's refereed theorem (J. Number Theory 2016): the products of powers of 2, 5 and c are d-complete for c in {9, 21, 23, 27, 29, 31}, with a finite-interval criterion for other c above 6 coprime to 10.

2023_03_20_chen_yu: Chen and Yu's refereed theorem (Acta Arith. 2023): products of powers of 2, 5 and r (r up to 87), of 2, 7 and r (up to 33) and of 3, 5 and r (up to 14), r coprime to the other two bases, are d-complete.

2026_07_15_snyder: Claims that for pairwise coprime a, b, c above one every large integer is a sum of distinct products of their powers, none dividing another, with a Lean proof; the site's curator accepted it, and nothing was built in the corpus.

2026_07_20_principia_math: Claims a second proof that the products of powers of three pairwise coprime bases are d-complete, with the summands confined to a short multiplicative window, written up and formalized in Lean; the site shows no verdict.

---