PropositionStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-26

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A positive integer $n$ is primitively represented by some discriminant $Δ$ form exactly when $Δ$ is a square modulo $4 n$

Statement

Let $n$ be a positive integer and let $Δ \in Z$ . Then the following are equivalent:

some integral binary quadratic form of discriminant $Δ$ primitively represents $n$ ;
$Δ$ is a square modulo $4 n$ .

Facts & Assumptions

Given: A positive integer $n$ and an integer $Δ$ .

[F1]

A form primitively represents $n$ when $n = f (r, s)$ for some integers $r, s$ with $\gcd (r, s) = 1$ (Integers represented, and primitively represented, by a binary quadratic form).

[F2]

The discriminant of $(a, b, c)$ is $b^{2} - 4 a c$ (The discriminant of a binary quadratic form).

[F3]

Proper equivalence means substitution by a determinant-one integer matrix, and properly equivalent forms have the same discriminant (Proper equivalence of binary quadratic forms, Proper equivalence preserves discriminant and primitivity of the form).

[L1]

$\gcd (r, s) = 1$ if and only if $r u - s t = 1$ for some integers $t, u$ ( $a$ and $b$ are coprime if and only if $a x + b y = 1$ for some integers $x, y$ ; and in that case the only common divisors of $a$ and $b$ are $1$ and $- 1$ ).

[L2]

$a \equiv b (m o d m)$ means that $m$ divides $a - b$ (Congruence modulo an integer: $a \equiv b (m o d n)$ when $n ∣ (a - b)$ , including the moduli $0$ and $1$ ).

Proof

technique · direct

1.1

Suppose a form $f = (a, b, c)$ of discriminant $Δ$ primitively represents $n$ , say $n = f (r, s)$ with $\gcd (r, s) = 1$ . By [L1] choose integers $t, u$ with $r u - s t = 1$ , and put $M = (\begin{array}{cc} r & t \\ s & u \end{array}) \in {S L}_{2} (Z)$ .

F1L1givenchoose

1.2

Conversely, suppose $Δ \equiv b^{2} (m o d 4 n)$ for some integer $b$ . Then $4 n$ divides $b^{2} - Δ$ , so $c : = (b^{2} - Δ) / (4 n)$ is an integer. The form $f = (n, b, c)$ has discriminant $Δ$ , and $f (1, 0) = n$ with $\gcd (1, 0) = 1$ , so it primitively represents $n$ .

F1F2L2givenconstructalgebra

2.1

The properly equivalent form $g = f ∣ M$ has leading coefficient $g (1, 0) = f (r, s) = n$ , so $g = (n, b^{'}, c^{'})$ for some integers $b^{'}, c^{'}$ . By [F3], $g$ has the same discriminant $Δ$ , hence $Δ = b^{' 2} - 4 n c^{'}$ , which says exactly that $Δ \equiv b^{' 2} (m o d 4 n)$ .

F2F3step 1.1algebra

3.1

Step 2.1 proves that primitive representation implies the square congruence, and step 1.2 proves the converse.

step 2.1step 1.2∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

Andrew Granville, Binary Quadratic Forms, Proposition 4.1 (standard reference, not scraped)

A positive integer nn is primitively represented by some discriminant ΔΔ form exactly when ΔΔ is a square modulo 4n4n