No products in the cart.

Find the HCF of 92690, 7378,7161 …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Find the HCF of 92690, 7378,7161 use its Euclid division algorithm
  • 1 answers

Sia ? 6 years, 6 months ago

We have to find the HCF, by Euclid's division algorithm of the numbers 92690, 7378 and 7161.
Here, we will apply Euclid's Division Lemma, we have
92690 = 7378 × {tex}{/tex}12 + 4154
Again we apply Euclid's Division Lemma of divisor 7,378 and remainder 4154, thus we have
7378 = 4154 × {tex}{/tex}1 + 3,224
4154 = 3224 × {tex}{/tex}1 + 930
3224 = 930 × 3 {tex}{/tex} + 434
930 = 434 ×  2 {tex}{/tex}+ 62
434 = 62 ×  {tex}{/tex}7 + 0
HCF of 92690 and 7378= 62
Now, using Euclid's Division Lemma on 7161 and 62, we have
7161 = 62 × {tex}{/tex}115 + 31
Again, applying Euclid's Division Lemma on divisor 62 and remainder 31, we have
62 = 31 × {tex}{/tex}2 + 0
Clearly, HCF of 7161 and 62 = 31
Hence, HCF of 92690, 7378 and 7161 is 31.

https://examin8.com Test

Related Questions

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