Continued Fraction Expansions

Q: Why avoid floating point when expanding an algebraic number?

Because each step multiplies the relative error by roughly the square of the denominator. After a few dozen terms a double-precision expansion is producing partial quotients that are pure noise. Quadratic irrationals should be expanded with the exact integer triple recurrence; other algebraic numbers need interval arithmetic with a certified precision budget.

Q: How long is the period of the expansion of a square root?

It grows roughly like the square root of D, which makes the classical continued fraction method for regulators exponential in the size of the discriminant. This is exactly the limitation that Shanks's infrastructure method and the sub-exponential algorithms were designed to overcome.

Q: Do continued fractions still matter given LLL?

Yes. LLL generalises the idea to higher dimension, but in one dimension continued fractions are faster, exact and optimal. They also remain the natural language for real quadratic fields, where the infrastructure is built directly on the expansion.

Executive summary

The optimal way to approximate a real number by rationals

Every real number has a simple continued fraction expansion, finite exactly when the number is rational. Its convergents are the best rational approximations of their height — no fraction with a smaller denominator comes closer. Lagrange's theorem characterises the expansions that are eventually periodic as exactly those of quadratic irrationals, which is why continued fractions solve Pell's equation, compute fundamental units of real quadratic fields and drive an early factoring method.

Learning objectives

Compute a continued fraction expansion and its convergents.
State and use the best-approximation property.
Apply Lagrange's theorem to recognise quadratic irrationals.
Explain the role of the expansion of √D in Pell's equation.
Manage precision correctly when expanding a floating-point number.

Section 01Expansion and convergents

The expansion of a real x is generated by repeatedly taking the integer part and inverting the remainder:

x = a₀ + 1/(a₁ + 1/(a₂ + …)) written [a₀; a₁, a₂, …]

The convergents p_n/q_n follow a linear recurrence that requires no fraction arithmetic:

p_n = a_np_n−1 + p_n−2, q_n = a_nq_n−1 + q_n−2

The determinant identity

p_nq_n−1 − p_n−1q_n = (−1)ⁿ⁻¹. Consecutive convergents are automatically in lowest terms and form a Bézout pair — which is the precise sense in which continued fractions and the extended Euclidean algorithm are the same computation.

Section 02Best approximation

The convergents are optimal approximations: if q ≤ q_n and p/q ≠ p_n/q_n, then p/q is strictly further from x. The error satisfies

|x − p_n/q_n| < 1/(q_nq_n+1) ≤ 1/q_n²

A large partial quotient a_n+1 means the preceding convergent is exceptionally good — the classical example is the approximation of π that arises from the partial quotient 292. This is the mechanism behind integer relation detection: an unexpectedly large partial quotient signals hidden rational structure.

Section 03Periodicity and quadratic irrationals

Lagrange's theorem: a continued fraction expansion is eventually periodic if and only if the number is a quadratic irrational. For √D with D not a perfect square, the expansion is purely periodic after the first term and has a palindromic body.

The expansion is computed exactly, without floating point, by tracking a triple (P, Q, a) representing (P + √D)/Q:

AlgorithmExpansion of √D in exact integer arithmeticin: D not a perfect square → out: periodic expansion of √D

Set a₀ ← ⌊√D⌋, P ← a₀, Q ← D − a₀².
If Q = 0 then D is a perfect square; stop.
Set a ← ⌊(a₀ + P)/Q⌋. All quantities remain integers throughout.
Set P' ← aQ − P and Q' ← (D − P'²)/Q.
Emit a; set (P, Q) ← (P', Q') and repeat from step 3.
The period ends when (P, Q) returns to its first recurring value.

Pell's equation

The fundamental solution of x² − Dy² = 1 appears as a convergent at the end of the first period. This is also the fundamental unit of the associated real quadratic order, which is why the regulator of a real quadratic field is a continued fraction computation.

ReferenceFrequently asked questions

Why avoid floating point when expanding an algebraic number?

Because each step multiplies the relative error by roughly the square of the denominator. After a few dozen terms a double-precision expansion is producing partial quotients that are pure noise. Quadratic irrationals should be expanded with the exact integer triple recurrence; other algebraic numbers need interval arithmetic with a certified precision budget.

How long is the period of the expansion of a square root?

It grows roughly like the square root of D, which makes the classical continued fraction method for regulators exponential in the size of the discriminant. This is exactly the limitation that Shanks's infrastructure method and the sub-exponential algorithms were designed to overcome.

Do continued fractions still matter given LLL?

Yes. LLL generalises the idea to higher dimension, but in one dimension continued fractions are faster, exact and optimal. They also remain the natural language for real quadratic fields, where the infrastructure is built directly on the expansion.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Continued Fraction Expansions. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Continued Fraction Expansions as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—continued, section, fractions, periodicity, theorem—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Continued Fraction Expansions?