Tutorial on Euclidean algorithm for GCD: pre RMO or PRMO 2019

For each of the following pairs of integers a and n, show that a is relatively prime to n, or that a and n are coprime to each other:

  1. a=13, n=20
  2. a=69, n=89
  3. a=1891, n=3797
  4. a=6003722857, n=77695236973 (the Euclidean algorithm only requires 3 steps for these integers!).

Cheers,

Nalin Pithwa.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.