Integrality and closed form for a greatest-common-divisor exponential sum
Let , , and be positive integers, and set
Let denote Euler's totient function and let be a primitive -th root of unity. Arithmetic conjecture. The exponential sum
is an integer; the question is whether it has a closed-form expression. This conjecture is motivated by the preceding formula for the partial zeta function of the curve and is suggested as likely provable using known combinatorial identities; no proof or resolution is supplied here.
References
Primary source
Noah Bertram, Xiantao Deng, C. Douglas Haessig and Yan Li, “Partial zeta functions, partial exponential sums, and p-adic estimates”, arXiv:2106.09755 (2022).
Progress summary
A reader-submitted counterexample says the statement is false as written, while a natural corrected version is claimed proved with an explicit formula.
The problem asks whether a greatest-common-divisor exponential sum is always integral and has a closed form, in the setting of partial zeta functions for the curve . The surrounding 2021 paper supplies motivation but does not resolve this exact question.
Community submission (unverified; August 20 and August 26, 2026)
A submission gives , , , and , obtaining , so the literal statement is false. It identifies the omitted condition and claims that the corrected assertion is true, including a divisor formula involving multiplicative orders and Ramanujan sums. A later submission reformulates as the geometric sum, treats the general case, and presents a proof via a prime-power source lemma; these arguments remain unverified.
Current status (as of August 2026): The unrestricted statement is claimed disproved by a counterexample, while the corrected version with and a closed form is claimed proved, but neither claim has independent verification.
Solutions 2
CounterexampleThis solution needs a summarySee full solution
As stated, the conjecture is false because no restriction is imposed on . Take
Then and , so
The natural missing hypothesis in the preceding cyclotomic-product formula is . With this correction, the conjecture holds and admits an explicit closed form.
Write , put
and for every with , let , with . Let
denote the Ramanujan sum. For every ,
To prove this, first note that if , , and , then
Work modulo each , using
If , both divisibility conditions reduce to . If but , the order of modulo is a nontrivial -power, so and . Thus both and are units modulo , and (3) proves (2).
Finally, if , then is a unit modulo , since otherwise contradicts . The same holds for , except possibly when and . In this exceptional case , and reduction modulo is injective on the cyclic subgroup generated by modulo , because its kernel is a -group. Therefore ; since and are units, both and vanish modulo . This establishes (2).
The reduction map
is surjective for every . Consequently (2) shows that depends only on the order of , equivalently on .
Now expand
Any sharing a prime factor with never contributes. For the remaining , Euler's theorem gives . Grouping indices modulo , the contribution vanishes unless ; otherwise it equals
The residues giving elements of order are
They all contribute exactly when , and their exponential sum is . This proves (1). Since and every Ramanujan sum is integral, the right-hand side belongs to .
Thus the unrestricted statement has the explicit counterexample , whereas the intended restricted statement is true with the closed form (1).
This solution needs a summarySee full solution
MathDB #351036 -- correction, proof, and divisor formula
Corrected statement
For positive integers n,a,d, define the geometric sum
The source context requires k to divide phi(n), a condition omitted from
the MathDB statement. If zeta_k is a primitive k-th root of unity, put
Then
The geometric-sum definition also covers a=1 without a 0/0 quotient.
The literal MathDB statement is false
The record imposes no condition on k. Take
Here phi(n)=1 and M_1=1, so the displayed sum is zeta_3, not a rational
integer. The intended restriction k | phi(n) is forced by the source's
preceding zeta-function factorization.
Source lemma
Theorem 3.1 of the source gives the following special case. Let q be a
prime power, let D be positive, and suppose k | phi(n). Then
Indeed, take the source's extension vector (d_1,d_2)=(D,1), whose gcd is
c=1. The quantity in (2) is the integer exponent of the corresponding
cyclotomic factor in the rational partial zeta function.
Proof when gcd(a,n)=1
If n=1, (1) is immediate. Otherwise Dirichlet's theorem supplies a prime
For every i,
and consequently
Substitute (3) into the source lemma with D=d. This proves (1) whenever
a is a unit modulo n.
Reduction of the general case
Factor n=n_0n_1, where
If p | a, then M_i(a,d) = 1 (mod p). Hence no prime factor of n_1
divides M_i, and
Set
Because gcd(a,n_0)=1, the sequence
has period h_0: Euler's theorem makes every summand in M_i periodic
modulo n_0. Split the sum into i=r+t h_0. Since k | h,
For the first line of (5), the finite geometric sum vanishes unless
zeta_k^{h_0}=1; this condition is exactly k | h_0. In the second case,
the remaining expression is E_k(n_0,a,d), which is integral by the coprime
case. This completes the proof of (1).
A finite Ramanujan-divisor formula
Formula (5) already says that E_k=0 if k does not divide h_0. Suppose
now that k | h_0, and for g | h_0 define
The preceding integrality proof shows that the value is fixed by every Galois
automorphism, so it is independent of the chosen primitive k-th root. For
the Fourier calculation, take zeta_k=exp(2 pi i/k).
Then
where the Ramanujan sum is
To prove (6), first observe that f(i) depends only on gcd(i,h_0). It is
enough to show f(ui)=f(i) for every unit class u modulo h_0. Choose a
positive representative U of this class that is also coprime to n_0.
Such a representative always exists: for a prime p | n_0 that also divides
h_0, every representative is already nonzero modulo p; for each remaining
prime impose U=1 (mod p) alongside U=u (mod h_0) and use the Chinese
remainder theorem. Periodicity gives f(ui)=f(Ui).
Now fix p^e || n_0 and put x=a^i. The integer U is coprime to p, and
it is coprime to p-1 because p-1 | phi(p^e) | h_0.
- If
x=1as an integer, the geometric sum is simplyd, so there is nothing to prove. - For odd
p, ifxis not1 (mod p), exponentiation byUpreserves the order ofxmodulop; when that order dividesd, LTE applied to(x^d)^U-1preserves the valuation becausepdoes not divideU. Ifx=1 (mod p), LTE givesv_p(1+x+...+x^(d-1))=v_p(d), again unchanged byx -> x^U. - For
p=2,Uis odd. Ifdis odd the geometric sum is odd. Ifdis even, the 2-adic LTE formula gives valuationv_2(x+1)+v_2(d)-1, andv_2(x^U+1)=v_2(x+1).
Thus every truncated p-adic valuation entering the gcd with n_0 is
unchanged. Units modulo h_0 act transitively on residue classes having the
same gcd with h_0, so
Group the Fourier sum in (5) by g=gcd(i,h_0). The inner sum over the units
modulo h_0/g is precisely
c_(h_0/g)(h_0/k), proving (6).
The exact checker verify_integrality.py verifies the literal counterexample,
the prime-transfer identity, the nonunit reduction, the even-function property,
and formula (6) without floating-point arithmetic.
Solved by the Principia Math harness. Check out our work at principia-math.com
Models used: GPT 5.6 Sol, Fable