Euclidean algorithm, modulo operation, and continued fractions (basic)
A fraction
whose denominator
is written as the sum of an integer and a fraction.
In general,
rational numbers
can be expressed as the ratio of two integers,
Irrational numbers can't do that.
Irrational numbers
can also be expressed as fractions by using special fractions
called continuous fractions.
Let's look at the Euclidean algorithm's modulo operation in detail and create continued fractions.
This is a prerequisite for expanding the Euclidean algorithm and solving the Diophantine equation.
I recommend that you learn it well.
I explained it so that you can understand it as much as possible.
In Korea, it is a university course, but if you learn it in advance,
It will be of great help in understanding and using mathematics.
#History of mathematics #Euclidean algorithm #Continuous fraction #Modulo operation #modular arithmetic
