Why is it as a consequence of the Euclidean Algorithm that ?

I know we start off with . From here do we solve for and in terms of the previous remainders eventually solving for in terms of ?

Thanks

Results 1 to 2 of 2

- August 10th 2007, 08:25 AM #1

- Joined
- Aug 2007
- Posts
- 239

- August 10th 2007, 09:28 AM #2
Are you asking for why or just an example of how to use it?

If you are asking for the why of it, basically it's because of the division algorithm, and the fact that products and sums of integers are integers.

For an example, consider 45 and 63:

63 = 1 * 45 + 18

45 = 2 * 18 + 9

18 = 2 * 9 + 0

Thus (45, 63) = 9

-Dan