Continued Fraction Expander
Find the finite simple continued-fraction coefficients of a rational number by Euclidean division, including correct floor behavior for negative numerators.
Description
Find the finite simple continued-fraction coefficients of a rational number by Euclidean division, including correct floor behavior for negative numerators.
Find the finite simple continued-fraction coefficients of a rational number by Euclidean division, including correct floor behavior for negative numerators.
When to use Continued Fraction Expander
Use this tool to test or transform exact integers according to the named number-theory definition, for education, validation, or algorithm checks.
- numerator
- An integer input.
- denominator
- An integer input.
How the calculation works
Limitations and assumptions
This tool applies an exact integer definition within JavaScript's safe-integer range. It is not an arbitrary-precision factorization or proof system, so do not use rounded measurements or integers beyond the accepted domain as though they were exact.
Alternative or Complementary approaches
Complement a number-property result with its factorization, divisors, digit representation, or a second independent predicate. A true result establishes only the named property and does not imply other properties such as primality.
References
-
Continued fraction — Wikipedia contributors
Similar or alternative tools
- Egyptian Fraction Expander
Expand a positive rational number into an integer part and distinct unit fractions using the greedy algorithm; output may have large denominators.
- Greatest Common Factor Calculator
Calculate the greatest common factor, also known as the greatest common divisor, of two safe integers.