No products in the cart.

Using Euclid division algorithm find the …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Using Euclid division algorithm find the largest number that divides125,9377 and 15628 leaving remainder 1,2 and 3 respectively
  • 1 answers

Sia ? 5 years, 11 months ago

The given numbers are 1251,9377 and 15628
Subtracting the remainders 1,2 and 3 from 1251,9377 and 15628 respectively we get
1251 - 1 = 1250,
9377 - 2 = 9375
15628 - 3 = 15625.
Therefore the said number= HCF(1250,9375,15625)
Now on applying Euclid's lemma on 1250 and 9375 we get
9375 = 1250 × 7 + 625
1250 = 625 ×2+0
Hence HCF (1250 , 9375 )= 625.
Now on applying Euclid's lemma on 15625 and 625 we get
15625=625 × 25+0
Hence, HCF (1250, 9375,15265)= 625.
Thus, the said number = 625.

http://mycbseguide.com/examin8/

Related Questions

Prove that root 8 is an irration number
  • 2 answers
sin60° cos 30°+ cos60° sin 30°
  • 2 answers
Venu Gopal has twice
  • 0 answers
Find the nature of quadratic equation x^2 +x -5 =0
  • 0 answers
X-y=5
  • 1 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