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, Lemma 3.2 with its proof and the definition of Md(X)M_d(X), physical p. 3 of the seven-page PDF held by van Doorn (2026). The displays were read on the page image, since the text extraction garbles them. Consumed by the Lemma 3.3 reconstruction. The note describes itself as a simplified and explicit version of the bound of the Price claim (abstract and Section 1, physical p. 1; Section 2, p. 2) and does not say which step of that argument this lemma replaces; the description of the Price claim's analytic input as an exponential-sum theorem comes from the site comment recorded on the Price card, not from the note.

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. The proof uses only Cauchy–Schwarz, Plancherel's identity and character orthogonality on Z/dZ\mathbb Z/d\mathbb Z, all written out below.

Definitions

D(n)D(n) is the set of positive divisors of nn, and eq(z)=exp⁡(2πiz/q)e_q(z)=\exp(2\pi iz/q). For a finite nonempty set XX of integers and an integer d≥1d\ge1,

Md(X)=1∣X∣2 ∣{(x,y)∈X2:x≡y(modd)}∣=∑a mod d(∣{x∈X:x≡a}∣∣X∣)2,M_d(X)=\frac1{|X|^2}\,\bigl|\{(x,y)\in X^2:x\equiv y\pmod d\}\bigr| =\sum_{a\bmod d}\Bigl(\frac{|\{x\in X:x\equiv a\}|}{|X|}\Bigr)^2 ,

the sum of the squares of the residue probabilities of XX modulo dd. For d≥1d\ge1 and ξ∈Z\xi\in\mathbb Z put

fd(ξ)=1∣X∣∑z∈Xed(ξz),f_d(\xi)=\frac1{|X|}\sum_{z\in X}e_d(\xi z),

so that ∣fd(ξ)∣≤1|f_d(\xi)|\le1 and fd(0)=1f_d(0)=1.

Statement

Let V1,V2V_1,V_2 be coprime positive odd integers, V=V1V2V=V_1V_2, Xi=D(Vi)X_i=D(V_i) and X=D(V)X=D(V). Let A>1A>1 be odd and suppose that

S:=∑d∣Ad>1d2/3(Md(X1) Md(X2) Md(X))1/3<1.(3.1)S:=\sum_{\substack{d\mid A\\ d>1}}d^{2/3} \bigl(M_d(X_1)\,M_d(X_2)\,M_d(X)\bigr)^{1/3}<1 . \tag{3.1}

Then every residue cc modulo AA has a representation

c≡z0+2z1+4z2+8z3(modA),z0,z1,z2,z3∈D(V).(3.2)c\equiv z_0+2z_1+4z_2+8z_3\pmod A,\qquad z_0,z_1,z_2,z_3\in D(V). \tag{3.2}

Proof

Fix a divisor dd of AA with d>1d>1; dd is odd. Three estimates are established for fdf_d, then combined.

Step 1: the pointwise bound at primitive frequencies. Since V1V_1 and V2V_2 are coprime, every divisor of VV factors uniquely as a divisor of V1V_1 times a divisor of V2V_2, so multiplication is a bijection X1×X2→XX_1\times X_2\to X and ∣X∣=∣X1∣ ∣X2∣|X|=|X_1|\,|X_2|. Grouping the elements of X1X_1 by residue class aa modulo dd, with N1(a)=∣{x∈X1:x≡a}∣N_1(a)=|\{x\in X_1:x\equiv a\}|,

fd(ξ)=1∣X1∣ ∣X2∣∑a mod dN1(a)∑y∈X2ed(ξay).f_d(\xi)=\frac1{|X_1|\,|X_2|}\sum_{a\bmod d}N_1(a)\sum_{y\in X_2}e_d(\xi ay).

By Cauchy–Schwarz over aa,

∣fd(ξ)∣2≤1∣X1∣2∣X2∣2(∑aN1(a)2)∑a mod d∣∑y∈X2ed(ξay)∣2=Md(X1)∣X2∣2∑a mod d∣∑y∈X2ed(ξay)∣2,|f_d(\xi)|^2\le\frac1{|X_1|^2|X_2|^2}\Bigl(\sum_aN_1(a)^2\Bigr) \sum_{a\bmod d}\Bigl|\sum_{y\in X_2}e_d(\xi ay)\Bigr|^2 =\frac{M_d(X_1)}{|X_2|^2} \sum_{a\bmod d}\Bigl|\sum_{y\in X_2}e_d(\xi ay)\Bigr|^2 ,

since ∑aN1(a)2=∣X1∣2Md(X1)\sum_aN_1(a)^2=|X_1|^2M_d(X_1). Expanding the square and summing over aa first, character orthogonality gives ∑a mod ded(ξa(y−y′))=d\sum_{a\bmod d}e_d(\xi a(y-y'))=d if d∣ξ(y−y′)d\mid\xi(y-y') and 00 otherwise. When (ξ,d)=1(\xi,d)=1 the condition is y≡y′(modd)y\equiv y'\pmod d, so the inner sum is d ∣X2∣2Md(X2)d\,|X_2|^2M_d(X_2) and

∣fd(ξ)∣2≤d Md(X1) Md(X2)((ξ,d)=1).|f_d(\xi)|^2\le d\,M_d(X_1)\,M_d(X_2)\qquad\bigl((\xi,d)=1\bigr).

Step 2: Plancherel. Expanding ∣fd(ξ)∣2|f_d(\xi)|^2 and summing over all ξ\xi modulo dd, orthogonality gives

∑ξ mod d∣fd(ξ)∣2=1∣X∣2∑z,z′∈X∑ξ mod ded(ξ(z−z′))=d Md(X).\sum_{\xi\bmod d}|f_d(\xi)|^2 =\frac1{|X|^2}\sum_{z,z'\in X}\sum_{\xi\bmod d}e_d(\xi(z-z')) =d\,M_d(X).

Step 3: the four-fold product. Since dd is odd, multiplication by 2ℓ2^\ell permutes the residues modulo dd and permutes the residues coprime to dd. Hence for (ξ,d)=1(\xi,d)=1 both ξ\xi and 2ξ2\xi are coprime to dd, and Step 1 bounds ∣fd(ξ)∣ ∣fd(2ξ)∣≤d Md(X1)Md(X2)|f_d(\xi)|\,|f_d(2\xi)|\le d\,M_d(X_1)M_d(X_2); and for ℓ∈{2,3}\ell\in\{2,3\}, ∑ξ mod d∣fd(2ℓξ)∣2=d Md(X)\sum_{\xi\bmod d}|f_d(2^\ell\xi)|^2=d\,M_d(X) by Step 2. Bounding the first two factors pointwise, extending the sum to all ξ\xi, and applying Cauchy–Schwarz to the last two,

∑ξmodd(ξ,d)=1∏ℓ=03∣fd(2ℓξ)∣≤d Md(X1)Md(X2)(∑ξ mod d∣fd(4ξ)∣2)1/2(∑ξ mod d∣fd(8ξ)∣2)1/2=d2Md(X1)Md(X2)Md(X).\sum_{\substack{\xi\bmod d\\(\xi,d)=1}}\prod_{\ell=0}^{3}|f_d(2^\ell\xi)| \le d\,M_d(X_1)M_d(X_2) \Bigl(\sum_{\xi\bmod d}|f_d(4\xi)|^2\Bigr)^{1/2} \Bigl(\sum_{\xi\bmod d}|f_d(8\xi)|^2\Bigr)^{1/2} =d^2M_d(X_1)M_d(X_2)M_d(X).

Step 4: orthogonality modulo AA. Suppose that some residue cc has no representation (3.2). The number of quadruples (z0,z1,z2,z3)∈X4(z_0,z_1,z_2,z_3)\in X^4 with z0+2z1+4z2+8z3≡c(modA)z_0+2z_1+4z_2+8z_3\equiv c\pmod A equals

1A∑h mod AeA(−hc)∑z0,…,z3∈XeA(h(z0+2z1+4z2+8z3))=∣X∣4A∑h mod AeA(−hc)∏ℓ=03fA(2ℓh),\frac1A\sum_{h\bmod A}e_A(-hc)\sum_{z_0,\dots,z_3\in X} e_A\bigl(h(z_0+2z_1+4z_2+8z_3)\bigr) =\frac{|X|^4}A\sum_{h\bmod A}e_A(-hc)\prod_{\ell=0}^{3}f_A(2^\ell h),

and by assumption it is 00. The term h=0h=0 equals 11. Every nonzero hh modulo AA is uniquely h=(A/d)ξh=(A/d)\xi with d=A/gcd⁡(h,A)>1d=A/\gcd(h,A)>1 a divisor of AA and 1≤ξ<d1\le\xi<d, (ξ,d)=1(\xi,d)=1; then eA(hz)=ed(ξz)e_A(hz)=e_d(\xi z) for every zz, so fA(2ℓh)=fd(2ℓξ)f_A(2^\ell h)=f_d(2^\ell\xi). Moving the h=0h=0 term to the left, taking absolute values, and grouping by dd,

1≤∑d∣Ad>1 ∑ξmodd(ξ,d)=1∏ℓ=03∣fd(2ℓξ)∣≤∑d∣Ad>1d2Md(X1)Md(X2)Md(X)1\le\sum_{\substack{d\mid A\\d>1}}\ \sum_{\substack{\xi\bmod d\\(\xi,d)=1}} \prod_{\ell=0}^{3}|f_d(2^\ell\xi)| \le\sum_{\substack{d\mid A\\d>1}}d^2M_d(X_1)M_d(X_2)M_d(X)

by Step 3. Each term on the right is the cube of the corresponding nonnegative term d2/3(Md(X1)Md(X2)Md(X))1/3d^{2/3}(M_d(X_1)M_d(X_2)M_d(X))^{1/3} of SS, and a sum of cubes of nonnegative reals is at most the cube of their sum, so the right side is at most S3<1S^3<1. This contradiction proves the lemma.