# Continued Fraction Calculator

Convert numbers to continued fraction representation

> Canonical page: https://elysiatools.com/en/tools/continued-fraction

- **Category:** Math & Numbers

- **Keywords:** continued fraction, rational, approximation, math, number theory

## Overview

The Continued Fraction Calculator allows you to convert decimal numbers or standard fractions into their precise continued fraction representation. This tool is essential for mathematicians, students, and engineers looking to find rational approximations or analyze the structural properties of real numbers.

## Inputs

- **Input Type** (select)
- **Decimal Number** (number): Enter a decimal number
- **Numerator** (number): Enter numerator
- **Denominator** (number): Enter denominator
- **Max Terms** (number): Maximum number of terms

## When to use

- When you need to find the best rational approximation for an irrational number.
- When studying number theory or performing advanced mathematical analysis.
- When converting complex decimal values into a sequence of integers for algorithmic use.

## How it works

- Select your input type: either a decimal number or a fraction (numerator/denominator).
- Enter the value you wish to convert and set the maximum number of terms to generate.
- Click calculate to receive the sequence of coefficients that represent the continued fraction.
- Review the resulting array of integers that define the mathematical expansion.

## Use cases

- Finding rational approximations for engineering constants.
- Educational demonstrations of number theory concepts.
- Simplifying complex numerical expressions for computational efficiency.

## Frequently asked questions

### What is a continued fraction?

A continued fraction is an expression obtained through an iterative process of representing a number as the sum of its integer part and the reciprocal of another number.

### Can I use this for irrational numbers like Pi?

Yes, you can input decimal approximations of irrational numbers, and the tool will calculate the corresponding continued fraction terms up to your specified limit.

### What is the maximum number of terms I can generate?

You can generate up to 50 terms to ensure high precision and manageable output.

### Does this tool support negative numbers?

The calculator is designed primarily for positive real numbers and standard fractions.

### How does the 'Max Terms' setting affect the result?

The 'Max Terms' setting limits the depth of the expansion; higher values provide a more detailed representation, while lower values provide a shorter, simpler approximation.

## Related tools

- [Decimal to Fraction Calculator](https://elysiatools.com/en/tools/decimal-to-fraction-calculator): Convert decimals into simplified fractions or mixed numbers with configurable tolerance and denominator limits
- [Fraction to Decimal Calculator](https://elysiatools.com/en/tools/fraction-to-decimal-calculator): Convert fractions or mixed numbers into decimals with configurable precision and percentage output
- [Carmichael Function λ(n) Calculator](https://elysiatools.com/en/tools/carmichael-function): Group exponent λ(n) from prime factorization with φ(n) comparison, primitive-root existence, Korselt's Carmichael-number detection, and optional sample-unit verification.
- [Euler Totient Function φ(n) Calculator](https://elysiatools.com/en/tools/euler-totient-function): Exact φ(n) from trial-division factorization (n ≤ 10¹²) with optional coprime listing and Euler's theorem recall.
- [Fraction Decimal Converter](https://elysiatools.com/en/tools/fraction-decimal-converter): Convert between fractions and decimals with support for mixed numbers, improper fractions, and various decimal formats
- [Multiplicative Order Calculator mod n (ordₙ(a))](https://elysiatools.com/en/tools/order-of-element-mod-n): Smallest k with a^k ≡ 1 (mod n) via φ(n) reduction: power table, minimality proof, cyclic subgroup , primitive-root and maximal-order flags.
- [Perfect Number Checker](https://elysiatools.com/en/tools/perfect-number-checker): σ(n) = 2n ⟺ perfect. Factorization-based σ(n), proper-divisor sum, deficient/perfect/abundant classification, abundancy index, Euclid–Euler form. n ≤ 10¹².
- [Prime Counting Function π(n) Calculator](https://elysiatools.com/en/tools/prime-counting-function): Exact π(n) via a single-pass Sieve of Eratosthenes (n ≤ 10⁷) with n/ln n comparison, density, average gap, and the largest prime ≤ n.

## Samples

- [Web Image Processing Python Samples](https://elysiatools.com/en/samples/web-image-processing-python): Web Python image processing examples using PIL/Pillow including reading, saving, resizing, and format conversion
- [Android Image Processing Java Samples](https://elysiatools.com/en/samples/android-image-processing-java): Android Java image processing examples including reading/saving images, scaling, and format conversion
- [Android Image Processing Kotlin Samples](https://elysiatools.com/en/samples/android-image-processing-kotlin): Android Kotlin image processing examples including reading/saving images, scaling, and format conversion
- [Web Image Processing Rust Samples](https://elysiatools.com/en/samples/web-image-processing-rust): Web Rust image processing examples including image read/save, scaling, and format conversion