The exact formula conjecture for primitive representations by x^2+216y^2

From papers

Let mm be a positive integer with m1(mod24)m\equiv 1\pmod{24}. Suppose that all prime divisors of mm are congruent to 11, 55, 77, or 1111 modulo 2424, and write

m=p1a1p2a2pkakq1b1q2b2qnbn,m=p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}q_1^{b_1}q_2^{b_2}\cdots q_n^{b_n},

where p1,,pkp_1,\ldots,p_k belong to P\mathcal P and q1,,qnq_1,\ldots,q_n belong to the set Q\mathcal Q of primes not in P\mathcal P. Let N2(m)N_2(m) be the number of primitive integer solutions of x2+216y2=mx^2+216y^2=m, and let B(m):=bi:bi0(mod3)B(m):=|\\{b_i:b_i\equiv 0\pmod 3\\}|. The exact formula conjecture. With this notation,

N2(m)=2B(m)+k2nB(m)+1+4(1)nB(m)3=2n+k+1+2B(m)+k+2(1)nB(m)3.N_2(m)=2^{B(m)+k}\cdot\frac{2^{n-B(m)+1}+4\cdot(-1)^{n-B(m)}}{3} =\frac{2^{n+k+1}+2^{B(m)+k+2}\cdot(-1)^{n-B(m)}}{3}.

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

Open

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 x2+216y2x^2+216y^2 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 N2(m)N_2(m); they note that discriminant 864-864 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

Proof

Write

m=i=1kpiaij=1nqjbj1(mod24),m=\prod_{i=1}^k p_i^{a_i} \prod_{j=1}^n q_j^{b_j} \equiv1\pmod{24},

with piPp_i\in\mathcal P, qjPq_j\notin\mathcal P, and every prime divisor congruent to 1,5,7,1,5,7, or 11(mod24)11\pmod{24}. Put

B=#{j:3bj},t=nB.B=\#\{j:3\mid b_j\}, \qquad t=n-B.

We prove the exact conjectured formula

N2(m)=2n+k+1+2B+k+2(1)nB3.\boxed{ N_2(m) = \frac{2^{n+k+1} + 2^{B+k+2}(-1)^{n-B}}3. }

Consider the quadratic order

O=Z[216]=Z[66],disc(O)=864.\mathcal O=\mathbb Z[\sqrt{-216}] =\mathbb Z[6\sqrt{-6}], \qquad \operatorname{disc}(\mathcal O)=-864.

Its twelve reduced primitive positive forms fall into the following four genera, labeled by the residue modulo 2424 that they represent coprimely to 66:

1[1,0,216], [9,6,25], [9,6,25]5[5,4,44], [5,4,44], [8,8,29]7[4,4,55], [7,2,31], [7,2,31]11[8,0,27], [11,4,20], [11,4,20].\begin{array}{c|l} 1 &[1,0,216],\ [9,-6,25],\ [9,6,25]\\ 5 &[5,-4,44],\ [5,4,44],\ [8,8,29]\\ 7 &[4,4,55],\ [7,-2,31],\ [7,2,31]\\ 11&[8,0,27],\ [11,-4,20],\ [11,4,20]. \end{array}

The four ambiguous classes are

[1,0,216],[4,4,55],[8,0,27],[8,8,29].[1,0,216],\quad[4,4,55], \quad[8,0,27],\quad[8,8,29].

Consequently,

Cl(O)C2×C2×C3.\operatorname{Cl}(\mathcal O) \cong C_2\times C_2\times C_3.

Every prime dividing mm is coprime to the conductor and satisfies

(6p)=1.\left(\frac{-6}{p}\right)=1.

It therefore splits into conjugate invertible prime ideals. Choose one such ideal p\mathfrak p, and write

[p]=(γp,ϵp)(C2×C2)×C3.[\mathfrak p] =(\gamma_p,\epsilon_p) \in(C_2\times C_2)\times C_3.

The characterization of P\mathcal P by primitive representations of p2p^2 gives

pP    [p]2=1    ϵp=0.p\in\mathcal P \iff[\mathfrak p]^2=1 \iff\epsilon_p=0.

A primitive representation

m=x2+216y2,gcd(x,y)=1,m=x^2+216y^2, \qquad\gcd(x,y)=1,

selects, for each prime power pemp^e\Vert m, exactly one of the two conjugate primes, to its full exponent. Thus candidate primitive ideals correspond to independent signs

δp{1,1},\delta_p\in\{1,-1\},

and their classes have coordinates

(pemγpe, pemδpeϵp).\left( \prod_{p^e\Vert m}\gamma_p^e,\ \sum_{p^e\Vert m}\delta_pe\epsilon_p \right).

Because m1(mod24)m\equiv1\pmod{24}, the genus coordinate is trivial for every choice of signs. Therefore the corresponding ideal is principal precisely when

pemδpeϵp=0in C3.\sum_{p^e\Vert m}\delta_pe\epsilon_p=0 \quad\text{in }C_3.

The kk primes in P\mathcal P each contribute an unrestricted factor 22. So do the BB primes outside P\mathcal P whose exponents are divisible by 33. The remaining t=nBt=n-B primes contribute signs in C3C_3, and the root-of-unity filter gives

#{(δ1,,δt){±1}t:jδj=0(mod3)}=2t+2(1)t3.\#\left\{ (\delta_1,\ldots,\delta_t)\in\{\pm1\}^t: \sum_j\delta_j=0\pmod3 \right\} = \frac{2^t+2(-1)^t}{3}.

Finally,

O×={±1},\mathcal O^\times=\{\pm1\},

so each principal ideal gives exactly two primitive representations. Hence

N2(m)=2k+B+12nB+2(1)nB3=2n+k+1+2B+k+2(1)nB3,N_2(m) = 2^{k+B+1} \frac{2^{n-B}+2(-1)^{n-B}}3 = \frac{2^{n+k+1} + 2^{B+k+2}(-1)^{n-B}}3,

as claimed. The empty-factor case m=1m=1 is included and gives N2(1)=2N_2(1)=2.

0 endorsements
Shivam Patel ·