The exact formula conjecture for primitive representations by x^2+216y^2
The exact formula conjecture for primitive representations by x^2+216y^2
Let be a positive integer with . Suppose that all prime divisors of are congruent to , , , or modulo , and write
where belong to and belong to the set of primes not in . Let be the number of primitive integer solutions of , and let . The exact formula conjecture. With this notation,
The formula would give an exact count of the primitive representations relevant to the paper's Diophantine analysis; the source notes that it implies the main theorem, but provides no proof of the conjecture.
Progress summary
No public proof or disproof of the proposed counting formula has appeared.
Ballantine, Merca, and Radu proposed an exact formula for the number of primitive representations of integers by satisfying the stated congruence and factorization conditions. Their paper, dated 2022, explicitly labels the formula conjectural and does not prove it.
Known results
- Ballantine, Merca, and Radu (2022) proved a related representation-counting identity sufficient for their main parity theorem, but not the exact formula for ; they note that discriminant has twelve classes that cannot be separated by congruence classes.
Current status (as of August 2026): the formula remains conjectural, with no recorded proof, counterexample, or verified resolution.
Sources
Sources & referencesView supporting material
Primary source
Cristina Ballantine, Mircea Merca and Cristian-Silviu Radu, “Parity of 3-regular partition numbers and Diophantine equations”, arXiv:2212.09810 (2022).
Solutions 1
Sign in to submit a solution.
Write
with , , and every prime divisor congruent to or . Put
We prove the exact conjectured formula
Consider the quadratic order
Its twelve reduced primitive positive forms fall into the following four genera, labeled by the residue modulo that they represent coprimely to :
The four ambiguous classes are
Consequently,
Every prime dividing is coprime to the conductor and satisfies
It therefore splits into conjugate invertible prime ideals. Choose one such ideal , and write
The characterization of by primitive representations of gives
A primitive representation
selects, for each prime power , exactly one of the two conjugate primes, to its full exponent. Thus candidate primitive ideals correspond to independent signs
and their classes have coordinates
Because , the genus coordinate is trivial for every choice of signs. Therefore the corresponding ideal is principal precisely when
The primes in each contribute an unrestricted factor . So do the primes outside whose exponents are divisible by . The remaining primes contribute signs in , and the root-of-unity filter gives
Finally,
so each principal ideal gives exactly two primitive representations. Hence
as claimed. The empty-factor case is included and gives .