Tool to compute continued fractions. A continued fraction is the representation of a number N in a form of a series of integers (a0, a1, ..., an) such as N = (a0+1/(a1+1/(a2+1/(...1/(an))).

dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day! You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

This page is using the new English version of dCode, please make comments !

Tool to compute continued fractions. A continued fraction is the representation of a number N in a form of a series of integers (a0, a1, ..., an) such as N = (a0+1/(a1+1/(a2+1/(...1/(an))).

Answers to Questions

How to calculate a continued fraction?

Continued fraction expansion is close to algorithm of euclidean division, as for PGCD.

dCode retains ownership of the source code of the script Continued Fractions. Except explicit open source licence (free / freeware), any algorithm, applet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any snippet or function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in PHP (or Java, C#, Python, Javascript, etc.) which dCode owns rights can be transferred after sales quote. So if you need to download the Continued Fractions script for offline use, for you, your company or association, see you on contact page !

dCode uses cookies to customize the site content, analyze user behavior and adapt dCode to your use. Some data is stored and collected for advertising purposes and may be shared with our partners. OK