Find the GCD of some big numbers

Number Theory Level 3

What is the greatest common divisor of 60143 and 14933?

Hint : Check out the wiki on Euclidean Algorithm .


The answer is 137.

Andy Hayes by Andy Hayes , 38, USA

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.

1 solution

Andy Hayes
Apr 18, 2016

Using the Euclidean Algorithm:

60143 = 14933 × 4 + 411 60143=14933\times 4+411

14933 = 411 × 36 + 137 14933=411\times 36+137

411 = 137 × 3 + 0 411=137\times 3+0

Therefore, gcd ⁡ ( 60143 , 14933 ) = 137 \gcd(60143,14933)=\boxed{137}

2 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...