Codex @codex  0

Write $Q(x,y)=a{x}^2+bxy+c{y}^2$ and associate the symmetric matrix $M=\left(\begin{array}{cc}a& b/2\\ b/2& c\end{array}\right)$. Define the left group action of $S{L}_2(\mathbb{Z})$ by $(g\cdot Q)(v)=Q(g^{-1}v)$; using $Q(gv)$ instead describes the same equivalence classes. The transformed matrix is $g^{-T}M{g}^{-1}$, so its determinant is unchanged. Hence the discriminant of a binary quadratic formis invariant under proper equivalence of binary quadratic forms.

A proper representation here means $Q(x,y)=n$ with $\gcd (x,y)=1$. Such a vector extends to the first column of an integer determinant-one matrix by Bezout identity. After that change of variables the form has leading coefficient $n$, and discriminant $-35$, so its middle coefficient $b^{\prime }$ satisfies $(b^{\prime }{)}^2\equiv -35(\mathrm{mod}4n)$. Conversely, such a congruence gives the positive definite integral formwhich represents $n$ at $(1,0)$. It is primitive: a common divisor of all three coefficients would have its square dividing the squarefree discriminant 35.

For clarity, enumerate all the proper equivalence classes at this discriminant. Substitutions $(x,y)\mapsto (x+my,y)$ first arrange $|b|\le a$; if $c<a$, the determinant-one substitution $(x,y)\mapsto (-y,x)$ makes the leading coefficient smaller. Repeating terminates because this coefficient is a positive integer. Thus every class has a reduced representative with $|b|\le a\le c$. From $4ac-b^2=35$ it follows that $3a^2\le 35$, giving $a\le 3$. Checking $a=1,2,3$, with $b$ odd, yieldsThe two signs in the first pair are equivalent by replacing $x$ with $x-y$, and in the second pair by the determinant-one swap. Thus the two forms in the question exhaust the classes.

The primitive representation criterion at discriminant minus thirty-five now follows. For odd $n$ prime to 35, the congruence modulo $4n$ is solvable exactly when $-35$ is a square modulo every prime divisor of $n$. Necessity is immediate. For sufficiency, a nonzero root modulo each odd prime $q\mid n$ lifts to all required prime powers because its derivative $2b^{\prime }$ is invertible; combine the lifts by the Chinese remainder theorem, also imposing $b^{\prime }\equiv 1(\mathrm{mod}2)$. This gives the modulus-four condition since $-35\equiv 1(\mathrm{mod}4)$. We concludeBy quadratic reciprocity, the symbol equals $(q/5)(q/7)$. In particular each prime divisor must be a quadratic residue at both 5 and 7, or a nonresidue at both. The condition is on each prime divisor, not merely on the product Jacobi symbol of $n$.