Find the greatest number which divides 2011 and 2623 leaving remainder 9 and 5 respectively
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.
A number that divides 2011 with remainder 9, will divide (2011-9)=2002 with no remainder. Similarly the same number will divide (2623-5)=2618. Thus the number is the GCD of 2002 & 2618. 2 0 0 2 = 2 × 7 × 1 1 × 1 3 2 6 1 8 = 2 × 7 × 1 1 × 1 7 ∴ the GCD is 2 × 7 × 1 1 = 1 5 4 or the Euclidean Algorithm can be used to find the GCD.