Skip to content
Philoid
Browse Saved
Back to chapter
Maths
1. Euclids Algorithm and Real Numbers
Home · Class 10 · Maths · Ref. Book · 1. Euclids Algorithm and Real Numbers
Prev
Next
Q1 of 128 Page 9

Find g. c. d

10211, 2517

10211, 2517


Here, 10211 > 2517


10211 = 3517 × 4 + 143


2517 = 143 × 17 + 86


143 = 86 × 1 + 57


86 = 57 × 1 + 29


57 = 29 × 1 + 28


29 = 28 × 1 + 1


28 = 1 × 28 + 0


The last non- zero remainder is 1.


Therefore, g. c. d (10211, 2517) = 1


More from this chapter

All 128 →
1

Find g. c. d

144, 233

1

Find g. c. d

765, 65

2

Find g. c. d. of 736 and 85 by using Euclid's algorithm.

3

Prove g. c. d (a—b, a + b) = 1 or 2, if g. c. d. (a, b) = 1

Questions · 128
1. Euclids Algorithm and Real Numbers
1 2 3 4 5 6 1 1 1 2 3 4 1 1 1 1 2 2 2 2 3 3 3 4 4 4 4 4 5 6 7 8 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43
Back to chapter
ADVERTISEMENT
About Contact Privacy Terms
Philoid · 2026
  • Home
  • Search
  • Browse
  • Quiz
  • Saved