Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation (p. 2). is the set of positive integers; for sequences, means for every with some constant , and a vector is when each coordinate is. Vectors of are written as columns, and $\mathbb e_1,\mathbb e_2,\mathbb e_3$ is the standard basis (p. 8).
Lemma 2 (p. 8). There exist a matrix , mutually disjoint finite sets , and constants such that, for ,
Explicit data (proof, p. 9). The proof takes
, , , , , , and obtains , , . The factors and only make the six sets mutually disjoint. The paper remarks (p. 9) that its use of the lemma in the proof of Theorem 1 does not need the sets to be finite, only to have finitely many prime factors in all.
Check of the data (an observation of this page, not of the paper). With exact rational arithmetic, for vanishes for and equals , , for ; with the rows of , which send to , these give the printed , and . The 23 listed elements are distinct.
Source. V. Kovač, On the set of points represented by harmonic subseries, arXiv:2405.07681v3 (12 September 2024); Amer. Math. Monthly 132 (2025), 895--911: Lemma 2 in Section 3 on p. 8, its proof on p. 9 (arXiv v3 pagination). The edition read is identified on the source card.
Read depth. Claims checked: the statement and the explicit data were read clause by clause on the printed pages, and the power-sum identities behind were recomputed as stated above. Nothing here is independently reviewed.
Proof pointer
Page 9. Expanding in powers of up to an error, the matrix makes the second coordinate start at and the third at . The lemma then reduces to finding disjoint sets whose reciprocal power sums agree in the two powers other than and differ in power ; the paper supplies six elementary identities among unit fractions and their squares and cubes, verified by computer.
Dependencies
None beyond elementary expansions and the stated identities.
Bears on
- Problem 268: only as the arithmetic step in the proof of Theorem 1, whose page states the relation; the lemma alone says nothing about the set in the problem.