A finite or infinite expression of a real number as an integer part followed by a nested sequence of reciprocals of integers, typically written as [a0; a1, a2, ...] where the ai are partial quotients.

Principle

Continued fractions encode the Euclidean algorithm on real numbers and produce the best rational approximations via convergents; periodicity relates to quadratic irrationals.

Demonstration

The golden ratio φ = (1+√5)/2 has simple continued fraction [1;1,1,1,...] with all partial quotients equal to 1; its convergents 1, 2/1, 3/2, 5/3,... approach φ optimally.

Misapplication

Using a finite truncation as if it fully represents an irrational number or treating arbitrary non-integer partial quotients as a simple continued fraction misuses the standard simple continued fraction form.

Consequence

Truncating a continued fraction at finite depth yields convergents that are the best approximations with bounded denominators; periodic continued fractions characterize quadratic irrationals and solve Pell-type equations.

Reversal

Reversing the concept gives decimal or other base expansions; these produce uniform digit sequences but lack the same optimal Diophantine approximation properties and the canonical periodicity classification for quadratics.

Boundary

Applies to real numbers and can be generalized; 'simple' continued fraction requires integer, typically positive, partial quotients (except possibly a0). Generalized continued fractions allow non-integer or negative partial quotients.

Semantic Tension

Distinguish simple continued fractions (nested unit reciprocals of integers) from more general continued fractions and from other expansions like decimal expansions; different forms have different approximation guarantees.

Synthesis

A continued fraction is a nested reciprocal expansion reflecting the Euclidean algorithm on a real number; its convergents provide canonical rational approximations and its structure reveals arithmetic features such as periodicity for quadratic irrationals.