What is the greatest common divisor of and ?
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.
Subtract the two numbers to obtain 2 2 0 1 6 − 2 2 0 1 0 . The GCD should divide this difference. Factor out 2 2 0 1 0 because any power of 2 greater than 1 will not divide either number. This leaves 63, and since any power of 2 6 leaves a remainder of 1 when divided by 63, both 2 2 0 1 6 − 1 and 2 2 0 1 0 − 1 are divisible by 63.