If the last four digits of my phone number are placed in front of the remaining three you get one more than twice my number! What is it?
This article sets some puzzles and describes how Euclid's algorithm
and continued fractions are related.
A java applet that takes you through the steps needed to solve a
Diophantine equation of the form Px+Qy=1 using Euclid's algorithm.
For previous article in series, click here . See also the
Approximations, Euclid's Algorithm and Continued Fractions to
find out how Euclid's algorithm can be used for any numbers, not
just integers, and how it is used to find rational approximations
very quickly, such as approximations to pi.