No products in the cart.

Find the HCF by euclid division …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Find the HCF by euclid division algorithm of the numbers 92690 , 7378 , 7161.
  • 3 answers

Divyansh Sharma 6 years, 11 months ago

Start answer in downward sorry....... Mistake

Divyansh Sharma 6 years, 11 months ago

Sorry.......??????7378=4154×1+3224 (remainder≠0) 4154=3224×1+930 (remainder≠0) 3224=930×3+434(remainder≠0) 930=434×2+62(remainder≠0) 434=62×7+0(remainder=0). therefore,HCF(92690,7378)=62 7161=62×115+3162=31×2=0 Therefore, HCF(7161,62)=31 Hence,HCF(92690,7378,7161)=31

Divyansh Sharma 6 years, 11 months ago

By using euclid division algorithm 92690=7378×12+4154
https://examin8.com Test

Related Questions

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