Q2 of 128 Page 9

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

Here, 736 > 85

736 = 85 × 8 + 56


85 = 56 × 1 + 29


56 = 29 × 1 + 27


29 = 27 × 1 + 2


27 = 2 × 13 + 1


2 = 1 × 2 + 0


The last non- zero remainder is 1.


Therefore, g. c. d (736, 85) = 1


More from this chapter

All 128 →
1

Find g. c. d

765, 65

 1

Find g. c. d

10211, 2517

 3

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

 4

Using the fact that g. c. d (a, b) l.c.m.. (a, b) = ab, find l.c.m.. (115, 25)