No products in the cart.

Use euclid's 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's division algorithm to find HCF of 1651 and 2032.write steps aldo
  • 1 answers

Sia ? 6 years, 5 months ago

 2032 = 1651 {tex} \times{/tex} 1 + 381 .
1651 = 381 {tex} \times{/tex} 4 + 127 
381 = 127 {tex} \times{/tex} 3 + 0. 
Since the remainder becomes 0 here, so HCF of 1651 and 2032 is 127.
{tex} \therefore{/tex} HCF (1651, 2032) = 127.
Now,
{tex} 1651 = 381 \times 4 + 127{/tex}
{tex} \Rightarrow \quad 127 = 1651 - 381 \times 4{/tex}
{tex} \Rightarrow \quad 127 = 1651 - ( 2032 - 1651 \times 1 ) \times 4{/tex} [from 2032 = 1651 {tex} \times{/tex} 1 + 381]
{tex} \Rightarrow \quad 127 = 1651 - 2032 \times 4 + 1651 \times 4{/tex}
{tex} \Rightarrow \quad 127 = 1651 \times 5 + 2032 \times ( - 4 ){/tex}
Hence, m = 5, n = -4.

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
(A + B )²
  • 1 answers
Prove that root 8 is an irration number
  • 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