Engel Expansion Calculator for Positive Fractions

Enter a fraction such as 4/13 and receive the nondecreasing sequence of Engel denominators, the corresponding unit-fraction terms, and a normalized version of the input. Every calculation uses integer arithmetic, so repeating decimal approximations and floating-point rounding cannot change the result. The tool is useful for number theory study, worked examples, symbolic checks, and software tests where a canonical, reproducible expansion matters.

What an Engel expansion represents

An Engel expansion writes a positive real number as a sum whose denominators are cumulative products. If the returned list is a1, a2, a3, the represented value is 1/a1 + 1/(a1 a2) + 1/(a1 a2 a3), continuing in the same pattern for every later entry. For a positive rational input, the process terminates, so the calculator returns a finite list and a finite expression. The denominators are nondecreasing, which gives the representation its characteristic ordered structure. This differs from an ordinary Egyptian fraction decomposition: both use unit fractions, but an Engel expansion constrains every new term through the product of all denominators selected so far. The output therefore includes both the raw denominator list, which is convenient for mathematical work or code, and the expanded product-sum terms, which make the represented value easier to inspect. The input fraction is reduced first, making equivalent inputs such as 8/26 and 4/13 produce the same normalized fraction and the same expansion.

How the exact algorithm works

The calculation starts with the current positive rational value p/q and chooses the next denominator as the ceiling of q/p. That choice is made with integer division, not by converting the fraction to a decimal. The residual is then transformed according to the Engel recurrence: replace p with a times p minus q, retain q, and reduce the resulting fraction by its greatest common divisor. When the new numerator is zero, the expansion is complete. Otherwise, the same steps select the next denominator. Because all numerators, denominators, ceilings, products, and reductions use arbitrary-precision integers, the answer stays exact even when the source values are much larger than JavaScript's safe integer range. The implementation also rejects malformed text, zero, negative values, and a zero denominator instead of guessing what the user meant. Input size and expansion length are bounded to keep execution predictable. These rules make the result deterministic across browsers and API workers: the same valid fraction always yields byte-for-byte equivalent mathematical data.

Reading and using the result

Begin with the denominators field when you need the canonical Engel sequence. Its entries are strings so that very large integers remain exact when the response passes through JSON systems that cannot safely represent every integer as a numeric value. The length field reports how many denominators and therefore how many unit-fraction terms occur. The expansion field multiplies the selected denominators cumulatively and displays each reciprocal, making it straightforward to verify the sum independently with rational arithmetic. For teaching, compare each chosen denominator with the ceiling rule and work through the residual after every step. For software testing, use the normalized fraction and denominator array as stable fixtures, including equivalent unreduced inputs to confirm normalization. Remember that this capability accepts positive fractions only; it does not calculate an infinite expansion for an irrational decimal, interpret mixed-number notation, or approximate a floating-point value. Via the API, each request costs $0.002. The browser and API versions share the same pure solver, so interactive exploration and automated calls follow identical arithmetic rules.