Continued Fraction calculator
- Alpertron
- Web applications
- Continued Fraction calculator
This Web application shows the continued fraction expansion of rational numbers and quadratic irrationalities.
Any real number x can be represented uniquely by a continued fraction:
x is equal to a sub 0 plus 1 over a sub 1 plus 1 over a sub 2 plus 1 over a sub 3 plus etcetera
where a_{1}, a_{2}, a_{3}, ... are integer numbers greater than zero. A more compact representation is:
x is equal to a sub 0 plus double slash a sub 1, a sub 2, a sub 3, etcetera double slash
If the number to be represented is rational, there is a finite number of terms in the continued fraction. If the number is a quadratic irrationality of the form fraction whether the numerator is a plus the square root of b and the denominator is c , then the continued fraction is periodic. This calculator can find the continued fraction expansions of rational numbers and quadratic irrationalities. Apart from the coefficients a_{n}, the program allows to find the convergent A_{n}/B_{n}. This quotient is the best rational approximation to the argument x with denominator less or equal to B_{n} and matches the value obtained by developing only the first n coefficients of the continued fraction.
You can type numbers or numerical expressions on the input boxes.
The calculator accepts numbers of up to 10000 digits.
If you need the square root to subtract the number at the left, just negate both a and c.
If b is negative, the result is not a real number, so it cannot be represented as a continued fraction.
For rational numbers the calculator finds the coefficients and the numerator and denominator of all convergents, but for quadratic irrationalities the calculator stops after the 100000th convergent if the period is larger. When the program displays convergents, it stops before if it runs out of memory.
Expressions
You can use the following operators and parentheses for the expressions:
- + for addition
- - for subtraction
- * for multiplication
- / for integer division
- % for modulus (remainder of the integer division)
- ^ or ** for exponentiation (the exponent must be greater than or equal to zero).
- <, ==, >; <=, >=, != for comparisons. The operators return zero for false and -1 for true.
- Ans: retrieves the last answer.
- AND, OR, XOR, NOT for binary logic. The operations are done in binary (base 2). Positive (negative) numbers are prepended with an infinite number of bits set to zero (one).
- SHL or <<: When b ≥ 0, a SHL b shifts a left the number of bits specified by b. This is equivalent to a × 2^{b}. Otherwise, a SHL b shifts a right the number of bits specified by −b. This is equivalent to floor(a / 2^{−b}). Example: 5 SHL 3 = 40.
- SHR or >>: When b ≥ 0, a SHR b shifts a right the number of bits specified by b. This is equivalent to floor(a / 2^{b}). Otherwise, a SHR b shifts a left the number of bits specified by −b. This is equivalent to a × 2^{−b}. Example: -19 SHR 2 = -5.
- n!: factorial (n must be greater than or equal to zero). Example: 6! = 6 × 5 × 4 × 3 × 2 = 720.
- n!! ... !: multiple factorial (n must be greater than or equal to zero). It is the product of n times n − k times n − 2k ... (all numbers greater than zero) where k is the number of exclamation marks. Example: 7!! = 7 × 5 × 3 × 1 = 105.
- p#: primorial (product of all primes less or equal than p). Example: 12# = 11 × 7 × 5 × 3 × 2 = 2310.
- B(n): Previous probable prime before n. Example: B(24) = 23.
- F(n): Fibonacci number F_{n} from the sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, etc. where each element equals the sum of the previous two members of the sequence. Example: F(7) = 13.
- L(n): Lucas number L_{n} = F_{n-1} + F_{n+1}
- N(n): Next probable prime after n. Example: N(24) = 29.
- P(n): Unrestricted Partition Number (number of decompositions of n into sums of integers without regard to order). Example: P(4) = 5 because the number 4 can be partitioned in 5 different ways: 4 = 3+1 = 2+2 = 2+1+1 = 1+1+1+1.
- Gcd(m,n, ...): Greatest common divisor of these integers. Example: GCD(12, 16) = 4.
- Lcm(m,n, ...): Least common multiple of these integers. Example: LCM(12, 16, 24) = 48.
- Modinv(m,n): inverse of m modulo n, only valid when m and n are coprime, meaning that they do not have common factors. Example: Modinv(3,7) = 5 because 3 × 5 ≡ 1 (mod 7)
- Modpow(m,n,r): finds m^{n} modulo r. Example: Modpow(3, 4, 7) = 4, because 3^{4} ≡ 4 (mod 7).
- Jacobi(m,n): obtains the Jacobi symbol of m and n. When the second argument is prime, the result is zero when m is multiple of n, it is one if there is a solution of x² ≡ m (mod n) and it is equal to −1 when the mentioned congruence has no solution.
- Random(m,n): integer random number between m and n.
- Abs(n): absolute value of n.
- Sign(n): returns zero if n is zero, −1 if negative or 1 if positive.
- IsPrime(n): returns zero if n is not probable prime, -1 if it is. Example: IsPrime(5) = -1.
- Sqrt(n): Integer part of the square root of the argument.
- Iroot(n,r): Integer r-root of the first argument. Example: Iroot(8, 3) = 2.
- NumDigits(n,r): Number of digits of n in base r. Example: NumDigits(13, 2) = 4 because 13 in binary (base 2) is expressed as 1101.
- SumDigits(n,r): Sum of digits of n in base r. Example: SumDigits(213, 10) = 6 because the sum of the digits expressed in decimal is 2+1+3 = 6.
- RevDigits(n,r): finds the value obtained by writing backwards the digits of n in base r. Example: RevDigits(213, 10) = 312.
You can use the prefix 0x for hexadecimal numbers, for example 0x38 is equal to 56.
Algorithms used
The calculation of the coefficients of the continued fraction of a rational number is done as follows:
- Obtain the first coefficient as the integer part of the quotient between the numerator and the denominator rounded down.
- Subtract the numerator from the product of the denominator and the newly found coefficient.
- While the numerator is not zero:
- Exchange the numerator and the denominator.
- Obtain the following coefficient as the integer part of the quotient between the numerator and the denominator rounded down.
- Subtract the numerator from the product of the denominator and the newly found coefficient.
The PQa algorithm is used to calculate the coefficients in the case of quadratic irrationalities, which are quotients between numerator + delta and denominator.
- Repeat indefinitely:
- Get the coefficient as the integer part of the quotient between numerator + delta and the denominator rounded down.
- Subtract the numerator from the product of the newly found coefficient and the denominator.
- Change sign to the numerator.
- Calculate an auxiliary result as the difference between delta and the square of the numerator.
- Replace the denominator by the quotient between the previous auxiliary result and the denominator.
Based on the coefficients, the convergent numerators A_{i} and denominators B_{i} can be calculated using the following operations:
- Initialize the current and previous convergent numerator with the values 1 and 0 respectively.
- Initialize the current and previous convergent denominator with the values 0 and 1 respectively.
- For each coefficient obtained:
- Calculate an auxiliary result as the product of the coefficient by the current convergent numerator.
- Obtain the next convergent numerator as the sum of the auxiliary result and the previous convergent numerator.
- Show the newly found value.
- Replace the previous convergent numerator with the current one.
- Replace the current convergent numerator with the next one.
- Perform the previous five steps replacing numerator by denominator.
Source code
You can download the source of the current program and the old continued fraction applet from GitHub. Notice that the source code is in C language and you need the Emscripten environment in order to generate JavaScript.
Written by Dario Alpern. Last updated 22 February 2024.