Let , where and are integers . Find the greatest common divisor of and 81.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Working modulo 8 1 in the ring Z [ 2 ] , we have (successively cubing or squaring) ( 1 + 2 ) 3 ( 1 + 2 ) 9 ( 1 + 2 ) 2 7 ( 1 + 2 ) 5 4 ( 1 + 2 ) 1 0 8 ( 1 + 2 ) 2 1 6 ≡ ≡ ≡ ≡ ≡ ≡ 7 + 5 2 1 6 + 1 3 2 7 0 + 4 1 2 − 1 1 2 − 1 1 and hence a + b 2 ≡ ≡ ( 1 + 2 ) 2 0 1 2 ≡ ( 1 + 2 ) 6 8 ≡ − 1 1 2 ( 1 + 2 ) 1 4 − 1 1 2 ( 1 6 + 1 3 2 ) ( 1 + 2 ) 5 ≡ 1 7 + 4 2 2 Thus b ≡ 4 2 ( m o d 8 1 ) , and hence the highest common factor of b and 8 1 is the highest common factor of 4 2 and 8 1 , namely 3 .