Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

../


Source. Wouter van Doorn and GPT-6 Astra Pro (the author line as printed), Practical numbers and Egyptian fractions, Corollary 3.4 with its proof, physical p. 5 of the seven-page PDF held by van Doorn (2026). Read on the page image. Uses the Lemma 3.1 reconstruction and the Lemma 3.3 reconstruction; consumed by the Proposition 4.1 reconstruction.

Standing. Author-recorded reconstruction of a claimed result (see the Lemma 3.1 page for the note's standing); not an independent review; changes no status and assigns no tier.

Statement

Under the hypotheses of Lemma 3.3 (so kk is large, p∗p_* is an odd prime, and VV is odd, squarefree, with ω(V)=k\omega(V)=k and all prime factors at most 2Q(k)2Q(k)), suppose that E≥4E\ge4 and that n=2EVn=2^EV is practical. Then the modulus AA supplied by Lemma 3.3 satisfies

An is practical,h(An)≤h(n)+4.An\text{ is practical},\qquad h(An)\le h(n)+4 .

Proof

Let cc be a residue modulo AA. Lemma 3.3 gives divisors z0,z1,z2,z3z_0,z_1,z_2,z_3 of VV with c≡z0+2z1+4z2+8z3(modA)c\equiv z_0+2z_1+4z_2+8z_3\pmod A. Consider the four integers 2ℓzℓ2^\ell z_\ell, ℓ=0,1,2,3\ell=0,1,2,3. Each divides 2EV=n2^EV=n, since ℓ≤3<E\ell\le3<E and zℓ∣Vz_\ell\mid V. Each is coprime to AA, since AA is odd and coprime to VV; in particular none is divisible by AA. They are distinct, since VV is odd, so the zℓz_\ell are odd and the 22-adic valuation of 2ℓzℓ2^\ell z_\ell is exactly ℓ\ell. Their sum is at most (1+2+4+8)V=15V<16V≤2EV=n(1+2+4+8)V=15V<16V\le2^EV=n. Thus every residue modulo AA is represented by a sum of at most 44 distinct divisors of nn with total at most nn and no summand divisible by AA, and A≥2A\ge2. Lemma 3.1 with L=4L=4 gives the conclusion.