No products in the cart.

Use Euclid division algorithm to find …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Use Euclid division algorithm to find the HCF of 900and 270
  • 1 answers

Yogita Ingle 4 years, 10 months ago

Euclid's division lemma :

Let a and b be any two positive

integers .Then there exists two

unique whole numbers q and r

such that

a = bq + r ,

0 ≤ r < b

Now , 900 and 270 , start with the larger integer , that is 900. Apply the
Division lemma , we get
900 = 270 × 3 + 90
270 = 90 × 3 + 0
The remainder has now become zero . Now our procedure stops.
Since the divisor at this stage is 90.
Therefore ,
HCF ( 900 , 270 ) = 90
 

http://mycbseguide.com/examin8/

Related Questions

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