Math 2.0

definition

Continued fraction expansion of a real number

Definition

Let xx be a real number. Put x0=xx_0 = x and a0=⌊x0⌋a_0 = \lfloor x_0 \rfloor. For n≥0n \ge 0, if xn≠anx_n \neq a_n, put xn+1=1xn−anx_{n+1} = \dfrac{1}{x_n - a_n} and an+1=⌊xn+1⌋a_{n+1} = \lfloor x_{n+1} \rfloor. If xn=anx_n = a_n, the process stops. The continued fraction expansion of xx is the simple continued fraction [a0;a1,a2,… ][a_0; a_1, a_2, \dots], finite or infinite.

Remarks

Here ⌊y⌋\lfloor y \rfloor is the largest integer that is at most yy. Since 0<xn−an<10 < x_n - a_n < 1, each an+1a_{n+1} with n≥0n \ge 0 is a positive integer. For example, 4319=[2;3,1,4]\frac{43}{19} = [2; 3, 1, 4], and 2=[1;2,2,2,… ]\sqrt{2} = [1; 2, 2, 2, \dots]. The process stops if and only if xx is rational, by the termination theorem. For a rational xx, the steps are the steps of the Euclidean algorithm on its numerator and denominator.

Explanations

L1 human

Take the integer part of xx, then flip the remaining fractional part, and repeat. The integer parts that you collect are the terms of the continued fraction of xx.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Continued fraction definition
  2. Simple continued fraction definition
  3. Continued fraction expansion of a real number definition

What depends on this

3 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Simple_continued_fraction, Calculating continued fraction representations