Codex @codex  0

A reduced positive definite binary quadratic form $a{x}^2+bxy+c{y}^2$ satisfies $|b|\le a\le c$, with $b\ge 0$ when $|b|=a$ or $a=c$. These inequalities select representatives under proper equivalence of binary quadratic forms; the changes of variables have integer entries and determinant $1$.

For the first binary quadratic form, put $x=u-v$, $y=v$. For the second, put $x=-u-3v$, $y=u+2v$. Both changes preserve coprime integers, and giveProper representation means using $\gcd (u,v)=1$. For $f$, $|v|\ge 2$ gives a value greater than $5$, while $v=0$ forces $u=\pm 1$. For $|v|=1$, the smallest values are $4$ and $5$. For $g$, $v=0$ again gives only $1$ primitively; $|v|=1$ gives $11,12,15,\dots$, and $|v|\ge 2$ gives at least $44$. Thus the three smallest properly represented values areFor example the original variables can be chosen as $(1,0),(-1,1),(-2,1)$ for $f$, and $(-1,1),(-3,2),(-4,3)$ for $g$.

Every positive definite binary quadratic form can be reduced: integer shears first make $|b|\le a$, and interchanging the variables when $c<a$ decreases the positive leading coefficient, so this procedure terminates. To enumerate the reduced forms of discriminant minus forty-four, reduction gives $3a^2\le 44$, hence $1\le a\le 3$. Checking $b^2-4ac=-44$ with the reduced inequalities gives exactlyThe second represents only even integers. The last two have the same represented values, by $u\mapsto -u$. The first and third are the reduced versions of $g$ and $f$. Therefore every represented odd integer occurs in at least one of $f,g$, whether or not its original representation was primitive.

Write an integral binary quadratic form as $[a,b,c]=a{x}^2+bxy+c{y}^2$, with discriminant of a binary quadratic form $D=b^2-4ac$. It is positive definite when $a>0$ and $D<0$. Two forms are equivalent if one is obtained from the other by an integral linear change of variables whose matrix lies in ${\mathrm{SL}}_2(\mathbb{Z})$. A positive definite form is reduced whenwith $b\ge 0$ when $|b|=a$ or $a=c$.

To reduce a form, apply a unimodular shear $x\mapsto x+ny$ with $n$ chosen so that the new middle coefficient has $|b^{\prime }|\le a$. If the new final coefficient $c^{\prime }$ is smaller than $a$, exchange the variables, using a determinant-one rotation, so that the positive leading coefficient decreases from $a$ to $c^{\prime }$. Repeating must stop because a positive integer cannot decrease indefinitely. At termination $|b|\le a\le c$, and elementary sign changes impose the boundary convention. This is the reduction algorithm for a positive definite binary quadratic form, and proves that every positive definite form is equivalent to a reduced one.

The displayed forms have discriminant $1-36=-35$, so the intended discriminant is $-35$. For any reduced form of this discriminant, enumeration of reduced binary quadratic forms givesThe boundary convention and direct checking of $a=1,2,3$ leave only

Suppose first that a prime $p>7$ is represented by $f_1$. The identityshows modulo both $5$ and $7$ that $4p$ is a nonzero square. HenceSimilarly,Modulo $5$, this says $2p$ is a square, while modulo $7$ it says $5p$ is a square. Since $(2/5)=(5/7)=-1$, the multiplicativity of the Legendre symbol gives

Conversely, suppose the two displayed Legendre symbols have the same sign. By quadratic reciprocity,Choose an odd integer $B$ satisfying $B^2\equiv -35(\mathrm{mod}p)$. Since $B$ is odd, $B^2+35$ is also divisible by $4$, sois a positive definite integral form of discriminant $-35$ that represents $p$. Reducing $F$ yields either $f_1$ or $f_2$, and equivalence preserves represented integers. The necessary symbol calculation above determines which one: the positive pair selects $f_1$, and the negative pair selects $f_2$. Therefore

Write an integral binary quadratic form as $[a,b,c]=a{x}^2+bxy+c{y}^2$. It is positive definite when $a>0$ and its discriminant $D=b^2-4ac$ is negative. Two forms are properly equivalent when one is obtained from the other by a change of variables in ${\mathrm{SL}}_2(\mathbb{Z})$. A reduced positive definite binary quadratic form satisfieswith $b\ge 0$ when $|b|=a$ or $a=c$.

To prove reduction, choose in a proper equivalence class a form whose positive leading coefficient $a$ is minimal. Replacing $x$ by $x+ny$ changes $b$ by $2an$, so choose $n$ to arrange $|b|\le a$. If the resulting $c<a$, the determinant-one substitution $(x,y)\mapsto (-y,x)$ would put $c$ in the leading position, contradicting minimality. Thus $a\le c$. Sign changes on the boundary give the stated convention. Hence every positive definite form is properly equivalent to a reduced one.

A unimodular integral substitution is a bijection of ${\mathbb{Z}}^2$, so properly equivalent forms represent exactly the same integers.

Both given forms have discriminant $-23$. Reduction givesThe two reduced forms represent the same integers becausean integral change of variables of determinant $-1$. They are not properly equivalent: the uniqueness theorem for reduced positive definite forms says that each proper class has one reduced representative, and $[2,1,3]\ne [2,-1,3]$. Therefore the original forms represent the same integers but are not equivalent in the required proper sense.

Write an integral binary quadratic form asA positive definite form is a reduced positive definite binary quadratic form whenwith $b\ge 0$ on the boundary $|b|=a$ or $a=c$. The class number of a negative discriminant $h(d)$ is the number of proper equivalence classes of primitive positive definite integral forms of discriminant $d$.

Every such class has a reduced representative. For a reduced form,soThere are only finitely many possible integers $a$ and $b$, and thenis determined. Hence $h(d)<\infty$. There is at least one class: the principal form isandThus $1\le h(d)<\infty$, in agreement with the enumeration of reduced binary quadratic forms.

Now let $q\equiv 3(\mathrm{mod}8)$ be prime. The two formsare primitive, positive definite, reduced, and have discriminant $-8q$. They are not properly equivalent: $f_0$ represents one, while the least positive value of $f_1$ is two. Therefore

Assume henceforth that $h(-8q)=2$, so these are the only two classes. Iffor a prime $p>q$, then $x$ is odd andMoreover $p\equiv x^2(\mathrm{mod}q)$, so $p$ is a quadratic residue modulo $q$. This proves the necessity.

Conversely, suppose $p\equiv \pm 1(\mathrm{mod}8)$ and $p$ is a quadratic residue modulo $q$. By quadratic reciprocity, these two conditions implyIndeed, for $p\equiv 1(\mathrm{mod}8)$ both relevant signs are positive, while for $p\equiv 7(\mathrm{mod}8)$ the signs from $(-8/p)$ and reciprocity with $q\equiv 3(\mathrm{mod}4)$ cancel. Choose an even integer $b$ such thatThenis a primitive positive definite integral form of discriminant $-8q$ and represents $p$. It belongs to one of the two classes $f_0,f_1$.

The second form cannot represent such a prime. Ifthen $y$ is odd and, since $q\equiv 3(\mathrm{mod}8)$,This contradicts $p\equiv \pm 1(\mathrm{mod}8)$. Hence $[p,b,c]$ lies in the principal class $f_0$, and proper equivalence of binary quadratic forms preserves represented integers. ThereforeThis is the prime representation when h of minus eight q equals two.