please answer this question
Attachments:
Answers
Answered by
2
please refer this Image dear.
#ATHARV= IITdreamer
#ATHARV= IITdreamer
Attachments:
Answered by
5
Given 1651m + 2032n.
2032> 1651
(1) 2032 = 1651 * 1 + 381
The remainder is not equal to 0. Use division algorithm to 1651 and 381.
(2) 1651 = 381 * 4 + 127
The remainder is not equal to 0. use division algorithm to 318 and 127.
(3) 381 = 127 * 3 + 0.
The remainder is 0.
Therefore the HCF of 1651 and 2032 = 127.
Now,
127 = 1651 - 381 * 4
= 1651 - (2032 - 1651) * 4
= 1651 - 2032 * 4 + 1651 * 4
= 1651(5) - 2032(4)
= 1651(5) + 2032(-4)
It is in the form of 1651(m) + 2032(n).
Therefore m = 5 and n = -4.
Hope this helps!
2032> 1651
(1) 2032 = 1651 * 1 + 381
The remainder is not equal to 0. Use division algorithm to 1651 and 381.
(2) 1651 = 381 * 4 + 127
The remainder is not equal to 0. use division algorithm to 318 and 127.
(3) 381 = 127 * 3 + 0.
The remainder is 0.
Therefore the HCF of 1651 and 2032 = 127.
Now,
127 = 1651 - 381 * 4
= 1651 - (2032 - 1651) * 4
= 1651 - 2032 * 4 + 1651 * 4
= 1651(5) - 2032(4)
= 1651(5) + 2032(-4)
It is in the form of 1651(m) + 2032(n).
Therefore m = 5 and n = -4.
Hope this helps!
siddhartharao77:
:-)
Similar questions