ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a1a_1 and a2a_2 be integers with a2>a1>40a_2>a_1>40 and gcd⁡(a1,a2)=1\gcd(a_1,a_2)=1. Let π2,a1,a2\pi_{2,a_1,a_2} denote the number of prime squares p2≤ga1,a2p^2\le g_{a_1,a_2} representable as p2=a1x1+a2x2p^2=a_1x_1+a_2x_2 with x1,x2∈Z≥0x_1,x_2\in\mathbb Z_{\ge 0}. Exceptional-pair conjecture. One has π2,a1,a2>0\pi_{2,a_1,a_2}>0. Moreover, only finitely many coprime pairs (a1,a2)(a_1,a_2) satisfy π2,a1,a2=0\pi_{2,a_1,a_2}=0, apart from the families (6,6g+5)(6,6g+5), (8,8g+7)(8,8g+7), (12,12g+11)(12,12g+11), and (24,24g+23)(24,24g+23) identified in the theorem preceding the conjecture. The conjecture is based on numerical experiments, and the text gives no resolution.

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.