Engel expansion explained

The Engel expansion of a positive real number x is the unique non-decreasing sequence of positive integers

(a _{1,a} _{2,a} _{3,...)} such thatx = (1)/(+ a _{1}) (1)/(+ a _{1a} _{2}) (1)/(a _{1a} _{2a} _{3}) + … = (1)/(a _{1}) \left( 1 + (1)/(a _{2}) \left( 1 + (1)/(a _{3}) \left( 1+ … \right)\right)\right)

For instance, Euler's number e has the Engel expansion

1, 1, 2, 3, 4, 5, 6, 7, 8, ...corresponding to the infinite series

e = (1)/(+ 1) (1)/(+ 1) (1)/(+ 1 ⋅ 2) (1)/(+ 1 ⋅ 2 ⋅ 3) (1)/(1 ⋅ 2 ⋅ 3 ⋅ 4) + …

Rational numbers have a finite Engel expansion, while irrational numbers have an infinite Engel expansion. If x is rational, its Engel expansion provides a representation of x as an Egyptian fraction. Engel expansions are named after Friedrich Engel, who studied them in 1913.

An expansion analogous to an Engel expansion, in which alternating terms are negative, is called a Pierce expansion.

Engel expansions, continued fractions, and Fibonacci

observe that an Engel expansion can also be written as an ascending variant of a continued fraction:

x = \cfrac{ 1+ \cfrac{ 1+ \cfrac{ 1+ … }{a _{3}}{a} _{2}}{a} _{1}.}

They claim that ascending continued fractions such as this have been studied as early as Fibonacci's Liber Abaci (1202). This claim appears to refer to Fibonacci's compound fraction notation in which a sequence of numerators and denominators sharing the same fraction bar represents an ascending continued fraction:

(a b c d)/(e f g h) = \dfrac{d + \cfrac{c + \cfrac{b + \cfrac{a}{e}}{f}}{g}}{h}.

If such a notation has all numerators 0 or 1, as occurs in several instances in Liber Abaci, the result is an Engel expansion. However, Engel expansion as a general technique does not seem to be described by Fibonacci.

Algorithm for computing Engel expansions

To find the Engel expansion of x, let

u _{1} = x, a _{k} = \left \lceil (1)/(u _{k}) \right \rceil,

and

u _{k+1} = u _{k} a _{k} - 1

where

\left \lceil r \right \rceil is the ceiling function (the smallest integer not less than r).

If

u _{i=0} for any i, halt the algorithm.

Iterated functions for computing Engel expansions

Another equivalent method is to consider the map

g(x) = x\left( 1 + \left\lfloor x ^{-1} \right\rfloor \right) - 1

and set

u _{k} = 1 + \left\lfloor (1)/(g ^{(n-1)} (x)) \right\rfloor whereg ^{(n)} (x) = g(g ^{(n-1)} (x)) and g ^{(0)} (x) = x.

Yet another equivalent method, called the modified Engel expansion calculated by

h (x) = \left\lfloor (1)/(x) \right\rfloor g(x) = \left\lfloor (1)/(x) \right\rfloor\left( x \left\lfloor (1)/(x) \right\rfloor + x - 1 \right)

and

u _{k} = \begin{cases} 1 + \left\lfloor (1)/(x) \right\rfloor & n = 1 \\ \left\lfloor (1)/(h ^{(k-2)} (x)) \right\rfloor\left( 1 + \left\lfloor (1)/(h ^{(k-1)} (x)) \right\rfloor \right) & n \geq 2 \end{cases}

The transfer operator of the Engel map

The Frobenius–Perron transfer operator of the Engel map

g(x) acts on functions f(x) with[ l{L} _{g} f] (x) = \sum _{y} (f (y))/(\left| (d)/(d z) g (z) \right| _{z}) = \sum ^{inf ty} _{n =1} (f \left( (x +1)/(n +1) \right))/(n +1)

since

(d)/(dx) [x(n +1 ) - 1 ] = n + 1 and the inverse of the n-th component is (x +1)/(n +1) which is found by solving x (n + 1 ) - 1 = y for x .

Relation to the Riemann ζ function

The Mellin transform of the map

g(x) is related to the Riemann zeta function by the formula\begin{align} \int ^{1} _{0} g(x) x ^{s-1} dx & = \sum ^{inf ty} _{n =1} \int ^{(1)/(n)} _{(1)/(n +1)} (x(n +1 ) - 1 ) x ^{s-1} dx \\[ 5 pt] & = \sum ^{inf ty} _{n =1} (n ^{-s} (s -1 ) + (n +1 ) ^{-} (n ^{2} +2 n +1 ) + n ^{-s-1} s - n ^{1-s})/((s +1 )s(n +1 )) \\[ 5 pt] & = (\zeta(s +1 ))/(s +1) - (1)/(s(s +1 )) \end{align}.

Example

To find the Engel expansion of 1.175, we perform the following steps.

u _{1} = 1 . 175 , a _{1} = \left\lceil (1)/(1 . 175) \right\rceil = 1 ; u _{2} = u _{1a} _{1} - 1 = 1 . 175 ⋅ 1 - 1 = 0 . 175 , a _{2} = \left\lceil (1)/(0 . 175) \right\rceil = 6 u _{3} = u _{2a} _{2} - 1 = 0 . 175 ⋅ 6 - 1 = 0 . 05 , a _{3} = \left\lceil (1)/(0 . 05) \right\rceil = 20 u _{4} = u _{3a} _{3} - 1 = 0 . 05 ⋅ 20 - 1 = 0

The series ends here. Thus,

1 . 175= (1)/(+ 1) (1)/(+ 1 ⋅ 6) (1)/(1 ⋅ 6 ⋅ 20)

and the Engel expansion of 1.175 is (1, 6, 20).

Engel expansions of rational numbers

Every positive rational number has a unique finite Engel expansion. In the algorithm for Engel expansion, if u_i is a rational number x/y, then u_{i + 1} = (-y mod x)/y. Therefore, at each step, the numerator in the remaining fraction u_i decreases and the process of constructing the Engel expansion must terminate in a finite number of steps. Every rational number also has a unique infinite Engel expansion: using the identity

(1)/(n) = \sum ^{inf ty} _{r =1} (1)/((n +1 ) ^{r}) .

the final digit n in a finite Engel expansion can be replaced by an infinite sequence of (n + 1)s without changing its value. For example,

1 . 175 = ( 1 , 6 , 20 ) = ( 1 , 6 , 21 , 21 , 21 , ... ).

This is analogous to the fact that any rational number with a finite decimal representation also has an infinite decimal representation (see 0.999...).An infinite Engel expansion in which all terms are equal is a geometric series.

Erdős, Rényi, and Szüsz asked for nontrivial bounds on the length of the finite Engel expansion of a rational number x/y ; this question was answered by Erdős and Shallit, who proved that the number of terms in the expansion is O(y^{1/3 + ε}) for any ε > 0.^[1]

Engel expansions for some well-known constants

\pi = (1, 1, 1, 8, 8, 17, 19, 300, 1991, 2492, ...) \sqrt{ 2 } = (1, 3, 5, 5, 16, 18, 78, 102, 120, 144, ...) e = (1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, ...)

The Engel expansion for arithmetic progressions can be represented as

\sum ^{inf ty} _{k =1} (1)/(\prod ^{k -1} _{i =0} (\alpha + i\beta)) = (1)/(\alpha) + (1)/(\alpha(\alpha + \beta)) + (1)/(\alpha(\alpha + \beta)(\alpha +2 \beta)) + … .

where

\alpha, \beta \in N and 0 < \alpha \leq \beta . Thus, in general\left( (1)/(\beta) \right) ^{1 - (\alpha)/(\beta)} e ^{(1)/(\beta)} \gamma\left( (\alpha)/(\beta) , (1)/(\beta) \right) = \{{\alpha}, \alpha(\alpha + \beta), \alpha(\alpha + \beta)(\alpha +2 \beta), ... \} where \gamma represents the lower Incomplete gamma function.

Specifically, if

\alpha = \beta ,e ^{1/\beta} -1= \{ 1 \beta, 2 \beta, 3 \beta, 4 \beta, 5 \beta, 6 \beta, ... \}

More Engel expansions for constants can be found here.

Growth rate of the expansion terms

\lim _{n\toinfty} a ^{1 /n} _{n} exists and is equal to e. However, the subset of the interval for which this is not the case is still large enough that its Hausdorff dimension is one.^[2]

The same typical growth rate applies to the terms in expansion generated by the greedy algorithm for Egyptian fractions. However, the set of real numbers in the interval (0,1] whose Engel expansions coincide with their greedy expansions has measure zero, and Hausdorff dimension 1/2.^[3]

See also

• Euler's continued fraction formula

References

• .
  • .
• .
  • .
• .
• .
• .

External links

• Web site: Weisstein, Eric W . Eric W. Weisstein . Engel Expansion . MathWorld–A Wolfram Web Resource .

Notes and References

1. .

2. . Wu credits the result that the limit is almost always e to Janos Galambos.
3. .