Skip to content

Continued Fraction

A finite or infinite recursively nested fraction defined by sequences of partial numerators and denominators.

Version
v1 · 2026-09-28 · History
Domain-specific #
8691
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Number Theory, Diophantine Approximation → Mathematics
Aliases
Continued fraction expansion, Regular continued fraction, Simple continued fraction

Core Idea

A continued fraction builds a value through repeated division: each denominator contains another additive term plus another fraction. Finite nesting ends in an ordinary rational expression; infinite nesting requires a convergence interpretation.

Simple continued fractions set every partial numerator to one and use positive-integer partial denominators, producing canonical number-theoretic expansions under standard endpoint conventions. Generalized forms allow other numbers or functions. Truncating at successive depths yields convergents that organize approximation.

How would you explain it like I'm…

Nesting-Doll Numbers

A continued fraction is a way to build a number like a set of nesting boxes. You start with a whole number, then add a piece made by dividing, and inside that piece there's another whole number plus another dividing piece, and so on. If you stop early, you get a number that's close to the real one, and each extra box gets you closer.

Fractions Inside Fractions

A continued fraction writes a number as a fraction inside a fraction inside a fraction. It looks like: a whole number, plus 1 over (another whole number plus 1 over (another whole number plus ...)). If the nesting stops, you get an ordinary fraction. If it goes on forever, you have to think about what number it's getting closer and closer to. Cutting it off at different depths gives fractions called convergents, which are good approximations of the number.

Iterated-Division Number Representation

A continued fraction builds a value by repeated division: a term plus a fraction whose denominator is another term plus another fraction, and so on. If the nesting is finite, it simplifies to an ordinary rational expression; if it's infinite, you need to define what it means for it to converge. In a simple continued fraction, every numerator is 1 and the other terms are positive whole numbers, which gives a standard way to expand numbers in number theory, with some conventions about how the last term is written. Generalized continued fractions allow other numbers or even functions. Cutting off the fraction at each depth gives values called convergents, which organize how well the number can be approximated.

 

A continued fraction represents a value through iterated division: each denominator consists of an additive term plus a further fraction. Finite nesting evaluates to an ordinary rational expression, whereas infinite nesting requires a convergence interpretation, typically as the limit of truncations. Simple continued fractions fix every partial numerator at 1 and use positive-integer partial denominators, yielding canonical number-theoretic expansions under standard conventions about the final term. Generalized continued fractions permit other numbers or functions as partial numerators and denominators. Truncation at successive depths produces the convergents, which structure rational approximation of the represented value. The concept is the nested-division representation together with this convergent structure, not merely any fraction.

Structural Signature

Sig role-phrases:

  • Integer or leading term — Supplies the initial additive component. It is initial term. Counterfactual: Omitting it restricts the represented range or changes indexing.
  • Partial numerators — Weight each recursive fractional step. It is coefficient sequence. Counterfactual: Fixing them to one defines the simple subclass.
  • Partial denominators — Provide the successive shifts or coefficients. It is coefficient sequence. Counterfactual: Invalid zero denominators can make finite stages undefined.
  • Nesting operation — Places each remaining fraction inside the next denominator. It is defining recursion. Counterfactual: A sum of separate fractions is not continued.
  • Convergents — Truncate the expansion to finite rational approximants. It is approximation sequence. Counterfactual: One truncation does not establish infinite convergence.
  • Limit condition — Determines whether an infinite expansion represents a value. It is analytic requirement. Counterfactual: A formal infinite nest may diverge.

What It Is Not

  • It is not a sum of ordinary fractions.
  • It is not automatically a simple continued fraction.
  • It is not guaranteed to converge when infinite.
  • It is not the same as a decimal or power series expansion.
  • Closest near-miss. Engel and Egyptian fraction expansions use sums of unit fractions; their hierarchical look does not make them continued fractions.

Scope of Application

  • Number theory. Represents rationals and irrationals and studies approximation.
  • Numerical analysis. Uses convergents and generalized fractions.
  • Complex analysis. Studies analytic continued-fraction expansions.
  • Special functions. Encodes ratios and recurrences through nested quotients.

Clarity

State finite or infinite status, notation convention, partial sequences, simple or generalized class, indexing, terminal convention, and convergence domain. Distinguish a formal expression from its evaluated limit.

Manages Complexity

A pair of coefficient sequences generates a deep recursive object and an ordered family of rational approximants. Recurrence relations replace repeated symbolic nesting with efficient computation.

Abstract Reasoning

  1. Identify leading and partial terms.
  2. Check denominators remain defined.
  3. Classify simple or generalized form.
  4. Compute finite convergents recursively.
  5. Establish convergence for an infinite expansion.
  6. Compare endpoint conventions before claiming uniqueness.

Knowledge Transfer

Recursive truncation transfers to other nested representations and rational-approximation schemes. Uniqueness, optimality, and convergence properties of simple real continued fractions do not automatically hold for generalized or complex versions.

Examples

Applied / In Practice

The rational 7/5 has a finite simple continued fraction [1;2,2], whose final truncation evaluates exactly to 7/5.

Mapped back: leading → 1; partial denominators → 2,2; numerators → 1; termination → finite.

Applied / In Practice

An irrational simple continued fraction supplies an endless integer sequence; successive convergents are rational and may approach the value.

Mapped back: sequence → infinite; approximants → finite truncations; requirement → convergence.

Structural Tensions

T1 — Compact Recursion versus Notation Convention. Equivalent values can have more than one finite ending and fields use simple versus generalized terminology differently.

Diagnostic: Which coefficient and terminal convention is declared?

T2 — Formal Infinity versus Analytic Convergence. Writing an infinite nest does not alone ensure a numerical limit.

Diagnostic: What theorem or condition establishes convergence?

Structural–Framed Character

Nested quotient recursion is structural; coefficient restrictions and analytic domain frame the mathematical species.

Structural Core vs. Domain Accent

Its core is denominator recursion. Number theory adds integer coefficients and Diophantine approximation; analysis adds functional coefficients and convergence.

This entry is a kind of Recursion.

  • Approved root. The frozen graph keeps this nested-fraction representation unparented.

  • Related — rational approximation, Euclidean algorithm, recurrence relation, and generalized continued fraction. They provide use, construction, computation, or broader class.

Relationships to Other Abstractions

Local relationship map for Continued FractionParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Continued FractionDOMAINPrime abstraction: Recursion — is a kind ofRecursionPRIME

Current abstraction Continued Fraction Domain-specific

Parents (1) — more general patterns this builds on

  • Continued Fraction is a kind of Recursion Prime

    Continued Fraction is a strict kind of Recursion: each denominator contains the next nested fraction under a repeated construction rule.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Continued Fraction sits in a crowded region of the domain-specific corpus (34th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Polynomial Rings & Rational Approximants (15 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

  • Egyptian fraction. Tell: A sum of distinct unit fractions.
  • Power series. Tell: Uses additive powers rather than nested denominators.
  • Decimal expansion. Tell: Uses positional digits.
  • Convergent. Tell: One finite truncation, not the whole continued fraction.

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Continued_fraction (revision 1371037158).
  • Preserved source candidate: https://www.ams.org/publications/authors/mit-2.pdf
  • Preserved source candidate: https://math.stackexchange.com/questions/75074/an-alternative-way-to-calculate-logx
  • Preserved source candidate: https://studylib.net/doc/7979641/general-method-for-extracting-roots-using–folded
  • Preserved source candidate: https://www.sciencedirect.com/science/article/pii/S0022314X10000193/pdfft?md5=36d08f2233a097cfd00962fe07a7378a&pid=1-s2.0-S0022314X10000193-main.pdf
  • Preserved source candidate: https://archive.org/details/historyofpisymbo00beck/page/131
  • Preserved source candidate: https://www.maa.org/press/periodicals/convergence/mathematical-treasure-raphael-bombellis-lalgebra
  • Preserved source candidate: https://projecteuclid.org/journalArticle/Download?urlid=em%2F1103749836
  • Preserved source candidate: http://mathematica.sns.it/opere/70/

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.