# 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

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Related Videos  Interactive Quiz:Euclid's Division Lemma44 mins  Fundamental Theorem of Arithmetic-238 mins  Fundamental Theorem of Arithmetic- 143 mins  Champ Quiz | Fundamental Principle Of Arithmetic41 mins  Euclids Division Lemma49 mins  NCERT | Imp. Qs. on Rational and Irrational Numbers44 mins  Quiz | Imp Qs on Real Numbers37 mins  Interactive Quiz - HCF and LCM32 mins  Application of Euclids Division Lemma50 mins  Relation Between LCM , HCF and Numbers46 mins
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation view all courses RELATED QUESTIONS :

g. c. d (136, 221, 391) = …….

Gujarat Board Mathematics

Find g. c. d

765, 65

Gujarat Board Mathematics

Find g. c. d

10211, 2517

Gujarat Board Mathematics

Find g. c. d

144, 233

Gujarat Board Mathematics

g. c. d (15, 24, 40) = …….

Gujarat Board Mathematics