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 the H.C.F of 1651 and 2032. Express the H.C.F in the form of 1651m+2032 n
  • 2 answers

Sia ? 5 years, 9 months ago

 2032 = 1651 × 1 + 381 .
1651 = 381 × 4 + 127 
381 = 127 × 3 + 0. 
Since the remainder becomes 0 here, so HCF of 1651 and 2032 is 127.
 HCF (1651, 2032) = 127.
Now,
1651=381×4+127
127=1651381×4
127=1651(20321651×1)×4 [from 2032 = 1651 × 1 + 381]
127=16512032×4+1651×4
127=1651×5+2032×(4)
Hence, m = 5, n = -4.

Ayush Kr Burnwal 3 years, 1 month ago

thanks a lot
http://mycbseguide.com/examin8/

Related Questions

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