ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let bb and cc be any integers given in Table 1, and let nn be a positive integer. For each prime pp, write λp=ord⁡p(n)\lambda_p=\operatorname{ord}_p(n). The notation r(n2,⟨1,b,c⟩)r(n^2,\langle 1,b,c\rangle) denotes the number of integer solutions of

n2=x2+by2+cz2.n^2=x^2+by^2+cz^2.

Cooper–Lam's conjecture. The number of representations is of the form

r(n2,⟨1,b,c⟩)=(∏p∣2bcg(b,c,p,λp))(∏p∤2bch(b,c,p,λp)),r(n^2,\langle1,b,c\rangle)=\left(\prod_{p \mid 2bc}g(b,c,p,\lambda_p)\right)\left(\prod_{p \nmid 2bc}h(b,c,p,\lambda_p)\right),

where

h(b,c,p,λp)=pλp+1−1p−1−(−bcp)pλp−1p−1,h(b,c,p,\lambda_p)=\frac{p^{\lambda_p +1}-1}{p-1}-\left(\frac{-bc}{p}\right)\frac{p^{\lambda_p}-1}{p-1},

and g(b,c,p,λp)g(b,c,p,\lambda_p) must be determined individually and case by case. The conjecture concerns the pairs (b,c)(b,c) listed in Table 1. The paper states that this conjecture is resolved using the fact that genera indistinguishable by squares yield closed formulas for representation numbers, so the displayed formula is not merely an open prediction for the listed pairs.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.