Ch2.0.11 — Of the Resolution of the Formula into its Factors
Summary: Investigates when the binary quadratic form admits multiple integer factorizations. Three cases by the sign and squareness of the discriminant . The middle term is removed by , reducing to . Imaginary factorizations produce the Brahmagupta-Fibonacci identity , which generates compound factorizations and explains why some primes split as sums of squares. Concludes with proto-genus theory: the forms and multiply by the rule .
Sources: chapter-2.0.11
Last updated: 2026-05-09
The Three Cases (§162–163)
Restrict to integers (any rational solution reduces here by clearing denominators). Three cases govern factorability:
| Case | Condition on | Form’s factors |
|---|---|---|
| 1 | positive square | two distinct rational factors |
| 2 | zero | one repeated rational factor |
| 3a | positive non-square | two simply irrational factors |
| 3b | negative | two complex (imaginary) factors |
This is the discriminant criterion familiar from ch1.4.9-nature-quadratic-equations and discriminant, but used here for factorability over rather than for real-vs-imaginary roots.
Eliminating the Middle Term (§167)
For the irrational/complex case it is convenient to remove . Substitute :
So the analysis reduces to the diagonal form (after rescaling).
Case 1: Rational Factors (§164–165)
If , set each factor to a sub-product: , . Then , with up to four factors. Solving the linear system in :
Integrality requires the numerators be divisible by — typically arranged by choosing or as multiples of the denominator.
Worked example — . Setting and :
so and must both be odd or both even. Taking : , , hence .
Case 2: Repeated Factor (§166)
If , set to obtain — arbitrarily many square factors. One of remains free.
Case 3: Imaginary Factors and the Brahmagupta-Fibonacci Identity (§169–171)
Here the formula factors only over :
If is a product of two integers each of the same form, then its complex factors must each split correspondingly. Set
Expanding and collecting rational/irrational parts:
and the product identity
This is Euler’s derivation of the brahmagupta-fibonacci-identity. See also the more general case- version below.
Two Representations from the Sign of
Since only appears, gives a second pair:
Hence a number expressible as a product admits two representations as . For , : . Multiplying three such factors gives four representations: .
Sums of Two Squares — Simple vs Compound (§172)
Numbers expressible as with split into:
- Compound: products of smaller representable numbers (use the identity above).
- Simple: irreducibly representable; namely .
Among the simple numbers Euler observes:
- All odd primes in this list are (i.e. of form ).
- The squares in the list have roots in form (which themselves are not representable, but their squares are).
- No number of form is a sum of two squares (the sum of an even and an odd square is ).
Euler then asserts (footnote 83): every prime of form is a sum of two squares. “This is undoubtedly true, but it is not easy to demonstrate it” — Fermat’s two-square theorem, first proved by Euler. See sums-of-two-squares.
The Form (§173–174)
Same imaginary-factorization trick with :
Numbers of form up to 50: . Simple ones (besides squares): . All prime simples are or ; primes are never of this form.
The General Form (§175–176)
Same identity with general :
Replacing by :
This gives the multiplication law for the Pell-related forms of ch2.0.7-pell-equation-method: solutions of form a multiplicative semigroup under this composition.
Coefficient on the First Term: (§177–179)
Now . The naïve copy of the previous trick fails (irrational ). The correct ansatz is:
Expanding gives
Notice the two factor types:
- Type I: (the original form).
- Type II: (which subsumes the previously studied family with ).
A product of two Type-I numbers turns out to be Type II:
So with , , we land in , i.e. Type II.
Proto-Genus Multiplication Table (§179–180)
The composition rule:
This extends to longer products: , , etc. — Type-I count modulo 2 determines the result, so the two genera form under multiplication.
This is a remarkable pre-Gaussian glimpse of genus theory for binary quadratic forms (Gauss, Disquisitiones Arithmeticae 1801).
Worked Example:
| Type | Form | Numbers |
|---|---|---|
| I | ||
| II |
Check the rule: should be Type I. Indeed has four representations: .
Simple numbers: Type I: ; Type II: .
Why This Matters
This chapter is the methodological heart of Euler’s number-theoretic chapters. The Brahmagupta-Fibonacci identity unifies:
- Sums of two squares (Fermat’s two-square theorem).
- Pell’s equation composition (cf. pell-equation).
- Cube and higher-power transformations of (next chapter, ch2.0.12-quadratic-form-as-power).
- Proto-genus theory for binary forms.
The use of imaginary numbers — long after they were dismissed as “impossible” in ch1.1.13-imaginary-quantities — to extract integer identities is, as Euler will note in §191, “remarkable, as we are brought to solutions, which absolutely required numbers rational and integer, by means of irrational, and even imaginary quantities.”