KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesPrime Decomposition in Quadratic FieldsEngineering · Engineering MathematicsLesson 806/888← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginprime decompositionquadratic fieldKronecker symbolsplit
On this page

Ask about this page

KEVOS AIPrime Decomposition in Quadratic Fields

KEVOS knowledge first · trusted web sources when needed

Quadratic Fields

Prime Decomposition in Quadratic Fields

How rational primes split, remain inert or ramify in a quadratic field, decided entirely by the Kronecker symbol.

Engineering / MathematicsQuadratic Fields2 min readKV-MATH-0600

Decomposition in a quadratic field requires no polynomial factorisation. A single Kronecker symbol evaluation decides the case, which makes prime handling in quadratic fields essentially free.

The three cases

Decomposition decided by one symbol evaluation
Kronecker symbol of the discriminant at pCaseFactorisation
1SplitTwo distinct primes, each of norm p
-1Inertp remains prime, norm p squared
0RamifiedA single prime squared, norm p

Key point

The degree relation is satisfied in each case: two times one for split, one times two for inert, two times one for ramified. Confirming this is the standard check — see the degree relation.

Constructing the primes

Building the primes above p

  1. Evaluate the symbolUsing the reciprocity-based algorithm — see symbol computation.
  2. Split caseSolve the congruence for a square root of the discriminant modulo p, giving two roots and hence two primes.
  3. Ramified caseThe single prime is generated by p and the appropriate root.
  4. Inert caseThe prime is generated by p alone.
P = (p, (b + sqrt(D))/2 ) with b^2 = D (mod 4p)The standard two-element form for a prime in a quadratic field.

Note

This two-element form corresponds directly to a binary quadratic form with first coefficient p and middle coefficient b, which is the correspondence exploited throughout the quadratic stream — see the correspondence.

Ramified primes

A prime ramifies exactly when it divides the discriminant. Since the discriminant is squarefree up to a factor of four, only finitely many primes ramify and they are immediately identified by trial division.

Splitting behaviour

Key point

The symbol depends only on the residue of p modulo the discriminant, so splitting behaviour is determined by congruence conditions. Half the primes split and half are inert, which is why factor bases for quadratic fields contain roughly half the primes below the bound — see factor base selection.

Consequences for factoring

The same criterion governs which primes can divide values of a quadratic form, which is exactly what determines the factor base in the quadratic sieve. The connection is not an analogy: the sieve is working in a quadratic order.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 5.1. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.

Related pages

  • Prime Decomposition: Theory and Ramification
  • Quadratic Field Discriminants and Integral Bases
  • Binary Quadratic Forms and the Ideal Correspondence

Continue learning

Quadratic Field Discriminants and Integral BasesArticle · Engineering MathematicsNEXT LESSON →Binary Quadratic Forms and the Ideal CorrespondenceGuide · Engineering MathematicsClass Group and Unit Computation: the Computational ProblemGuide · Engineering MathematicsReduction of Positive Definite Binary FormsArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®