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

765, 65

765, 65


Here 765 > 65


765 = 65 × 11 + 50


65 = 50 × 1 + 15


50 = 15 × 3 + 5


15 = 5 × 3 + 0


The last non- zero remainder is 5.


Therefore, g. c. d (765, 65) = 5


More from this chapter

All 128 →
6

Prove that product of four consecutive positive integers is divisible by 24.

1

Find g. c. d

144, 233

1

Find g. c. d

10211, 2517

2

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

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