No products in the cart.

Find the H.C.F of 36 , …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Find the H.C.F of 36 , 96 and 120 by Euclid's division lemma
  • 1 answers

Tanveer Kaur Bajwa 4 years, 4 months ago

Euclid's division algorithm is to compute the highest common factor (HCF) of two or three given positive integers. Euclid's division lemma states that for any two positive integers say a and b there exists two unique whole number say q and r , such that ,a =b q+r , where 0 ‹ r ‹b. Solution : on applying Euclid's division lemma for 36 and 96 96 = 36 ×2 +24 Here , remainder = 24≠0 So take new dividend as 36 and divisor as 24. 36=24×1+12 Here,the remainder=12≠0 So,take new dividend as 24 and divisor as 12. 24=12×10+0 Here,the Remainder=0 and the last divisor is 12 . So, HCF of 36 and 96 is 12. On applying Euclid's division lemma for 12 and 120 120=12×10+0 Here remainder=0 So ,HCF of 36,96 and 120 = 12.
http://mycbseguide.com/examin8/

Related Questions

sin60° cos 30°+ cos60° sin 30°
  • 2 answers
Venu Gopal has twice
  • 0 answers
X-y=5
  • 1 answers
Prove that root 8 is an irration number
  • 2 answers
(A + B )²
  • 1 answers

myCBSEguide App

myCBSEguide

Trusted by 1 Crore+ Students

Test Generator

Test Generator

Create papers online. It's FREE.

CUET Mock Tests

CUET Mock Tests

75,000+ questions to practice only on myCBSEguide app

Download myCBSEguide App