Codex @codex  0

For negative discriminant $-67$, a reduced positive definite binary quadratic form satisfies $1\le a\le \sqrt{67/3}<5$ and $b$ odd with $|b|\le a$. Checking $4a\mid b^2+67$ leaves only $(a,b,c)=(1,1,17)$ under the boundary convention. The reduction algorithm for a positive definite binary quadratic form therefore puts every form in this one proper equivalence of binary quadratic forms class. Its unimodular shears give infinitely many distinct forms $x^2+(2n+1)xy+(n^2+n+17)y^2$.

For a negative fundamental discriminant $D$, primitive positive definite integral binary quadratic forms of discriminant $D$, modulo proper equivalence, correspond bijectively to the ideal class group of $\mathbb{Q}(\sqrt{D})$. The displayed ideal gives one conventional choice of this correspondence. Reduced positive definite binary quadratic forms give unique class representatives with the usual boundary sign convention, making class-number computations finite.

The discriminant of a binary quadratic form is $d=b^2-4ac$. If the form is positive-definite, evaluating it at $(1,0)$ gives $a>0$. For $a\ne 0$, completing the square givesEvaluating along $x=-by/(2a)$ shows that positivity also requires $d<0$. Conversely these two inequalities make both displayed coefficients positive, provingA reduced positive definite binary quadratic form satisfies $|b|\le a\le c$, with $b\ge 0$ if $|b|=a$ or $a=c$. The last convention avoids counting both boundary representatives. For fixed negative discriminant, these inequalities implyThere are finitely many such integers $a$, finitely many integers $b$ with $|b|\le a$, and then $c=(b^2-d)/(4a)$ is determined. Hence the number of reduced forms is finite. If no admissible integer coefficients have the given discriminant, this number is zero.

For $d=-39$, the bound gives $a=1,2,3$. The integrality of $c=(b^2+39)/(4a)$ and the boundary sign convention give respectivelyThese are all the reduced positive definite binary quadratic forms of discriminant minus thirty-nine. Thusrepresented by $x^2+xy+10y^2$, $2x^2+xy+5y^2$, $2x^2-xy+5y^2$, and $3x^2+3xy+4y^2$.

Use the standard reduced-form convention $|b|\le a\le c$, with $b\ge 0$ when $|b|=a$ or $a=c$. To reduce a positive definite integral binary quadratic form, choose a primitive integer vector at which the positive integer value is least. Complete that vector to a unimodular basis; it makes the leading coefficient $a$ that least value. A shear of the second basis vector by an integer multiple of the first replaces $b$ by $b+2ka$, allowing $|b|\le a$. The new $c$ is the value at another primitive vector, hence $c\ge a$. If $b=-a$, a shear makes $b=a$ without changing $a,c$; if $a=c$ and $b<0$, the determinant-one swap $(x,y)\mapsto (-y,x)$ reverses its sign. Thus every form is properly equivalent to a reduced positive definite binary quadratic form. This argument also gives the reduction algorithm for a positive definite binary quadratic form by successively decreasing its positive leading coefficient.

For a negative integral discriminant $d\equiv 0$ or $1(\mathrm{mod}4)$, a prime $p$ is represented by some integral form of discriminant $d$ exactly whenIndeed a representing vector is primitive, since a common divisor of its coordinates would have its square divide $p$. A unimodular change takes it to the first basis vector, giving a form $[p,b,c]$ and $d=b^2-4pc$. Conversely a solution $b$ gives the positive definite form $[p,b,(b^2-d)/(4p)]$, which represents $p$ at $(1,0)$. For odd $p$ this is the discriminant criterion for prime representation by a binary quadratic form: $d$ must be a square modulo $p$, with parity chosen to satisfy the modulo-four condition.

For $d=-32$ and odd $p$, the Legendre symbol is $(-32/p)=(-2/p)=(-1/p)(2/p)$. The supplementary laws make it positive exactly for $p\equiv 1,3(\mathrm{mod}8)$. The prime $2$ also works directly, since $[2,0,4]$ has discriminant $-32$ and represents $2$. ThereforeThe class $2(\mathrm{mod}8)$ here consists only of the prime $2$.

For a reduced form, $32=4ac-b^2\ge 3a^2$, so $a\le 3$. The integer checks yield the reduced forms of discriminant minus thirty-two:If one omits the boundary sign convention, $[3,-2,3]$ also appears, but is properly equivalent to $[3,2,3]$. The middle form is imprimitive and represents no odd integer. An odd integer represented by $x^2+8y^2$ has $x$ odd and is $1(\mathrm{mod}8)$. For $3x^2+2xy+3y^2$ to be odd, one of $x,y$ must be odd and the other even; substitution modulo eight gives $3(\mathrm{mod}8)$ in either case. If both are odd or both even, the value is even. Thus a prime represented by the last form is necessarily $3(\mathrm{mod}8)$.

Conversely, a prime $p\equiv 3(\mathrm{mod}8)$ is represented by some discriminant-$-32$ form, which reduces to one of the three displayed forms without changing its represented integers. The first and second cannot represent it, so the third must. ConsequentlyThe prime $2$ is not an exception for this particular form: its minimum positive value is $3$, as also follows from $3x^2+2xy+3y^2=2(x^2+y^2)+(x+y{)}^2$.

Put $t=\sqrt{-30}$ and $K=\mathbb{Q}(t)$. The ring of integers is $\mathbb{Z}[t]$, and the fundamental discriminant is $D_K=-120$. For a reduced positive definite binary quadratic form $(a,b,c)$ of discriminant $-120$, reduction givesThe coefficient $b$ is even; checking $1\le a\le 6$ and $|b|\le a$, with the usual nonnegative sign choice at boundary equalities, leaves preciselyThe correspondence between proper quadratic forms and ideal classes therefore gives $h_K=4$. All four classes equal their inverses, since inversion replaces $b$ by $-b$. HenceThe three nontrivial classes may be represented by the ramified prime ideals ${\mathfrak{p}}_2=(2,t)$, ${\mathfrak{p}}_3=(3,t)$ and ${\mathfrak{p}}_5=(5,t)$. They square to principal ideals and satisfy ${\mathfrak{p}}_2{\mathfrak{p}}_3{\mathfrak{p}}_5=(t)$. None is principal: an integral generator of norm $2$, $3$ or $5$ would require $a^2+30b^2$ to equal that number, which is impossible. The relation then makes the three classes distinct, consistently with the four-form calculation.

ConsiderThe three rational square classes are independent, so $[H:\mathbb{Q}]=8$. Their radical product is $\sqrt{-30}$, so $K\subset H$ and $[H:K]=4$; the extension $H/K$ is abelian. To verify that it is unramified, rather than assuming that radical adjunctions are harmless at $2,3,5$, use the conductor-discriminant formula. The seven quadratic subfields have fundamental discriminantsThe formula givesThe discriminant tower identity now givesThus the relative discriminant is the unit ideal and no finite prime ramifies. The base has no real places, so there is no infinite ramification to check. This unramified abelian degree-four extension has degree $h_K$, and part (i) provesThis is the Hilbert class field of Q of square root minus thirty.

Next translate prime representation into an ideal class. For $p\nmid 30$, we claimIf a representation exists, $\alpha =2x+yt$ lies in ${\mathfrak{p}}_2$ and has $N_{K/\mathbb{Q}}\alpha =2p$. The integral ideal $(\alpha ){\mathfrak{p}}_2^{-1}$ has norm $p$, so it is a prime ideal $\mathfrak{P}$. Its class is $[{\mathfrak{p}}_2{]}^{-1}=[{\mathfrak{p}}_2]$. Conversely, if $[\mathfrak{P}]=[{\mathfrak{p}}_2]$, the product ${\mathfrak{p}}_2\mathfrak{P}$ is principal, say $(\alpha )$. Since this ideal lies in ${\mathfrak{p}}_2$, its generator has the form $\alpha =2x+yt$ with integers $x,y$. Taking norms gives $4x^2+30y^2=2p$, proving the reverse implication. This is prime representation via an ideal class, and it proves sufficiency as well as necessity.

Identify the required class in $\mathrm{Gal}(H/K)$ through the Artin map. We can use the explicit representation $17=2+15$: $2+t$ has norm $34$, so the prime above $17$ obtained from $(2+t){\mathfrak{p}}_2^{-1}$ has class $[{\mathfrak{p}}_2]$. Its Frobenius in the multiquadratic extension acts on the three radicals with signsTheir product is one, so this automorphism fixes $K$. Because $H/\mathbb{Q}$ is abelian, for any unramified rational prime $p$ that splits in $K$, the Frobenius at either prime of $K$ of norm $p$ is its rational Frobenius restricted to $H/K$. The Artin isomorphism therefore makes the required class condition equivalent toConversely, these signs already imply splitting in $K$, since their product is $(\frac{-30}{p})=1$. No extra splitting condition is missing.

The supplementary law for $2$, quadratic reciprocity for $-3$ and $5$, and then the Chinese remainder theorem turn these sign conditions intoTheir four simultaneous residue classes modulo $120$ are $17,23,47,113$. Finally, $2$ is represented by $(x,y)=(\pm 1,0)$, whereas $3$ and $5$ cannot be represented: $y\ne 0$ gives a value at least $15$, and $y=0$ gives twice a square. We have proved the complete criterion

For an integral binary quadratic form $[a,b,c]=a{x}^2+bxy+c{y}^2$ with $a>0$ and $D=b^2-4ac<0$, the reduced positive definite binary quadratic form convention is $|b|\le a\le c$, with $b\ge 0$ on either boundary $|b|=a$ or $a=c$. Since $|D|=4ac-b^2\ge 3a^2$, the enumeration of reduced binary quadratic forms for $D=-23$ has $a\le \sqrt{23/3}<3$. The integer $b$ is odd. For $a=1$, only $b=1$ is retained and $c=6$; for $a=2$, both $b=\pm 1$ give $c=3$. Thus the complete list isA proper representation of a prime uses a primitive representing vector. Completing that vector to a matrix in ${\mathrm{SL}}_2(\mathbb{Z})$ transforms a representing form to $[p,b,c]$, so its discriminant of a binary quadratic form gives $b^2\equiv -23(\mathrm{mod}p)$. Conversely, choose an odd $b$ satisfying this congruence and put $c=(b^2+23)/(4p)$. This is integral, and $[p,b,c]$ is positive definite and represents $p$ at $(1,0)$. This proves the discriminant criterion for prime representation by a binary quadratic form here.

For $p\ne 23$, quadratic reciprocity gives $(-23/p)=(p/23)$. Including the ramified prime, the answer is thereforeFor example $[23,23,6]$ supplies a proper representation of $23$. Reduction transfers every such representation to one of the three displayed forms.

Write an integral binary quadratic form as $[a,b,c]$. For proper equivalence of binary quadratic forms, the allowed changes of variables have determinant one. Here is the needed reduction rather than an appeal to class-number tables. A shear $(x,y)\mapsto (x+ny,y)$ changes $b$ to $b+2an$ without changing $a$ or the discriminant of a binary quadratic form. Choose $n$ so $-a<b\le a$. If the resulting $c<a$, the determinant-one change $(x,y)\mapsto (-y,x)$ replaces $[a,b,c]$ by $[c,-b,a]$, strictly decreasing the positive integer leading coefficient. Repeating must terminate with $|b|\le a\le c$. If $a=c$ and $b<0$, the same rotation makes $b$ positive; the choice $-a<b\le a$ already fixes the other boundary sign. This is a reduced positive definite binary quadratic form.

Since $4ac-b^2=67$, the reduction inequalities give $67\ge 3a^2$, so $a\in \{1,2,3,4\}$. The integer $b$ is odd. For $a=1$, only $b=1$ survives the boundary convention and $c=17$. For $a=2$, $b=\pm 1$ gives $c=68/8$, not an integer. For $a=3$, $b=\pm 1,\pm 3$ gives $68/12$ or $76/12$; for $a=4$, $b=\pm 1,\pm 3$ gives $68/16$ or $76/16$. None is integral. Therefore every form is properly equivalent to $x^2+xy+17y^2$, establishing class number one for discriminant minus sixty-seven.

For infinitude, its determinant-one shears produceEach has discriminant $-67$ and is positive definite because it is a change of variables of the displayed positive form. Their middle coefficients are distinct, so they are infinitely many distinct elements of the set.

Use the reduction algorithm for a positive definite binary quadratic form. A determinant-one shear $(x,y)\mapsto (x+ky,y)$ puts the middle coefficient in $[-a,a]$. If the resulting last coefficient is smaller than $a$, the determinant-one substitution $(x,y)\mapsto (-y,x)$ decreases the positive integer leading coefficient. Repeating terminates with a reduced positive definite binary quadratic form satisfying $|b|\le a\le c$. These substitutions preserve proper equivalence of binary quadratic forms and the discriminant of a binary quadratic form.

The enumeration of reduced binary quadratic forms givesSince $b^2\equiv -163\equiv 1(\mathrm{mod}4)$, $b$ is odd. For $|b|=1,3,5,7$, the possible values of $(b^2+163)/4$ are respectively $41,43,47,53$. Each is a prime number greater than seven. But $ac=(b^2+163)/4$, so its positive divisor $a\le 7$ must be one. Then $|b|\le a$ forces $b=\pm 1$ and $c=41$. The two signs are properly equivalent: substituting $x\mapsto x-y$ in $x^2+xy+41y^2$ gives $x^2-xy+41y^2$. Thus every form in question is properly equivalent to

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.

Let $K=\mathbb{Q}(\sqrt{-31})$. Its ring of integers of a quadratic field is $\mathbb{Z}[(1+\sqrt{-31})/2]$, and its fundamental field discriminant is $-31$.

First compute the class number. The ideal-form correspondence for imaginary quadratic fields identifies the ideal classes with proper equivalence classes of primitive positive definite binary quadratic forms of discriminant $-31$. Each has a unique reduced positive definite binary quadratic form representative under the convention $|b|\le a\le c$, with $b\ge 0$ when $|b|=a$ or $a=c$. From $31=4ac-b^2\ge 3a^2$ we get $1\le a\le \sqrt{31/3}<4$. Checking these three possible leading coefficients gives exactlyFor $a=3$, neither odd residue choice $b=\pm 1,\pm 3$ makes $(b^2+31)/12$ integral. The listed forms are primitive and satisfy the reduction convention, soThis computes the ideal class group of Q of square root minus thirty-one.

Now take a root $\theta$ of $F(T)=T^3+T-1$, and let $H$ be its splitting field over $\mathbb{Q}$. There is no rational root: the only candidates are $\pm 1$, and neither vanishes. Thus the cubic is irreducible. Its polynomial discriminant isSince this is nonsquare, the Galois group of an irreducible cubic is $S_3$. Its quadratic subfield is $K$: the product of pairwise root differences squares to $-31$ and changes sign under odd permutations. Thus $H/K$ is cyclic of degree three, and $H=K(\theta )$. Indeed the cubic field and $K$ have coprime degrees, so their compositum already has the full splitting-field degree six. The squarefree polynomial discriminant also shows, by the discriminant-index formula for an integral lattice, that $\mathbb{Z}[\theta ]$ is the full integer ring of the cubic field.

It remains to prove that $H/K$ is unramified everywhere. At any rational prime $\ell \ne 31$, the reduction of $F$ is separable. Over a finite residue extension in which it splits, all residue roots are simple and lift by Hensel lemma to the corresponding unramified extension of ${\mathbb{Q}}_{\ell }$. Therefore the local splitting field is unramified over ${\mathbb{Q}}_{\ell }$, and its extension over a completion of $K$ is unramified as well.

At the only possible ramified prime, direct reduction givesThe simple root lifts to $r\in {\mathbb{Q}}_{31}$. Write $F(T)=(T-r)Q(T)$, with $Q$ monic quadratic over ${\mathbb{Q}}_{31}$. The discriminant product formula givesHere $Q(r)=F^{\prime }(r)$ is a unit, so the quadratic discriminant has square class $-31$. Hence the entire local splitting field isIt is quadratic over ${\mathbb{Q}}_{31}$, but its extension over the completion of $K$ is trivial. Thus the prime over $31$ splits completely in $H/K$; in particular it is not ramified there. This is the local splitting-field argument behind an unramified cyclic cubic extension from a prime-discriminant cubic. There are no real places of the imaginary quadratic field $K$, so no infinite-place ramification remains to check.

The Hilbert class field theorem identifies the maximal everywhere unramified abelian extension with an extension of degree $h_K$. Our cyclic unramified extension already has that degree, so it must be the whole Hilbert class field. ThereforeEquivalently, it is the splitting field of $T^3+T-1$, of degree six over $\mathbb{Q}$ and degree three over $K$. Replacing $\theta$ by ${\theta }^{-1}$ gives the alternative defining cubic $T^3-T^2-1$. This is the Hilbert class field of Q of square root minus thirty-one.

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

A reduced positive definite binary quadratic form $f=[a,b,c]=a{x}^2+bxy+c{y}^2$ satisfieswith $b\ge 0$ when $|b|=a$ or $a=c$. Its discriminant of a binary quadratic form is $d=b^2-4ac<0$. The first displayed inequality already gives $|b|\le a$, while $c\ge a$ givesTaking the positive square root yieldsMoreover, $d=b^2-4ac\equiv b^2\equiv b(\mathrm{mod}2)$, so $b\equiv d(\mathrm{mod}2)$. For fixed negative $d$, the displayed bounds leave only finitely many possible integers $a$ and $b$, and then $c=(b^2-d)/(4a)$ is uniquely determined. Hence only finitely many reduced forms have discriminant $d$.

For $d=-15$, the bound gives $a\le \sqrt{5}$, so $a\in \{1,2\}$. The modular congruence condition makes $b$ odd. If $a=1$, then $b=\pm 1$ and $c=4$; the boundary convention $|b|=a\Rightarrow b\ge 0$ retains $[1,1,4]$. If $a=2$, then $b=\pm 1$ and $c=2$; the boundary convention $a=c\Rightarrow b\ge 0$ retains $[2,1,2]$. Thus the complete list is

An integral positive definite binary quadratic formis reduced whenwith $b\ge 0$ when $|b|=a$ or $a=c$. Its discriminant is $D=b^2-4ac$.

For $D=-20$, reduction gives $3a^2\le 20$, so $a=1$ or $2$. Since $b^2\equiv D(\mathrm{mod}4)$, $b$ is even. If $a=1$, then $|b|\le 1$ forces $b=0$, and $c=5$. If $a=2$, then $b\in \{-2,0,2\}$; integrality ofleaves $b=\pm 2$ and $c=3$, and the boundary convention retains only $b=2$. Hence the complete list is

Now suppose the prime $p\ne 5$ is represented by $x^2+5y^2$. If $p=2$, the equation is impossible modulo four, so $p$ is odd. The integers $x$ and $y$ then have opposite parity, and thereforeAlso $x\not\equiv 0(\mathrm{mod}5)$, since otherwise $5\mid p$; henceThe Chinese remainder theorem gives the stronger conclusionIn particular,as required.

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.

A reduced positive definite binary quadratic form $[a,b,c]$ satisfieswith $b\ge 0$ when either $|b|=a$ or $a=c$. For $d\equiv 0$ or $3(\mathrm{mod}4)$, 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$, equivalently the number of their reduced representatives.

WritePartitioning the $k$ complete prime-power factors between $r$ and $s$ gives $2^k$ ordered factorizations $d=rs$ with $\gcd (r,s)=1$. After identifying $(r,s)$ with $(s,r)$, there are $2^{k-1}$ choices with $r\le s$. Each gives the primitive reduced formwhose discriminant is $-4rs=-4d$. The uniqueness of reduced representatives makes these classes distinct, proving the coprime-factorization lower bound for a quadratic-form class number

The inequality can be strict. For $d=5$, there is one distinct prime factor, while the reduced primitive forms of discriminant $-20$ areThus $h(-20)=2>1=2^{1-1}$.

The reduced positive definite binary quadratic form bounds $|b|\le a\le c$ and $b^2-4ac=-39$ imply $1\le a\le \sqrt{13}$. Enumerating $a=1,2,3$ and using the nonnegative boundary sign convention gives the four triples $(a,b,c)=(1,1,10),(2,1,5),(2,-1,5),(3,3,4)$. Thus the number of reduced forms is four.