Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Y.-G. Chen and W.-X. Yu, On -complete sequences of integers, II, Acta Arith. 207 (2023), 161--181 (online 20 March 2023). As the paper's abstract and its zbMATH summary (Zbl 1528.11016) state, the authors give a criterion for the -completeness of for pairwise coprime and apply it to prove that is -complete for with , for with , and for with ; they also answer how sparse a -complete sequence can be. For Problem 123 this settles every triple in those three ranges.
Covers. The triples for , for and for , each coprime to the other two bases. Not covered: every other triple.
Depends on. Nothing in this wiki; the result rests on the cited paper. It extends Erdős and Lewin's triples and Ma and Chen's.
Read depth. The statement is taken from the paper's abstract on the publisher's page and its zbMATH summary; the body of the paper, which the library does not hold, was not read.
Acceptance. Refereed: Acta Arithmetica 207 (2023). The site's commentary
lists the result, but the site credits the settlement of the problem to Snyder's
proof, so the commentary is not reviewed evidence for this paper.