Interactive · 4 questions
Previously, we defined what a continued fraction for a rational is.
How do we find a continued fraction?
Right! We find the largest integer from whatever is remaining, and then reduce it to a similar problem, except smaller. For example, to find the continued fraction of , we know that the largest integer less than is . So, we know for some . We solve the equation for , to get Then, we continue similarly to get So, when we plug this back in to our first equation, we have
This process feels familiar... In what process do we find the largest integer less than some number, and then use the remainder?
Right! In the division algorithm, we find the largest multiple less than some integer and then the remainder. Let's try to see if these two processes are related.
Let's use our previous example so that we don't need to do as much work. We use the Euclidean algorithm, which is the division algorithm iterated repeatedly to divide by :
Wow! Isn't that a surprise? The quotients we get are exactly the numbers in the continued fraction! Let's try to figure out why this works.
Where would come from in the first place? Well, the only equation that has both and is the first one, so let's try to get a . This is exactly what we needed! Now we proceed in a similar fashion to find . We substitute this and we get
Great! Now it's time to try to formulate a proof.
Suppose we have the following equations: Then, we can rearrange each of them so that we have what we want:
Now what do we do?
Now, it's time to substitute repeatedly. This is exactly what we wanted to prove.
So what did we figure out?