find the hcf of two numbers 72 & 96 by euclids division algorithm and express it in the form of 96m + 72n where m & n are integers
Answers
Answered by
10
Hopefully my solution will satisfy you.
Attachments:
Answered by
13
Euclid division lemma:-
a = bq + r
0 ≤ r < b
Given numbers,
72 and 96
96 > 72
96 = 72(1) + 24
As the remainder is 24,we need to proceed further.
72 = 24(3) + 0
As remainder is 0,we can not proceed any further.
So,HCF of the given numbers is 24.
HCF (72,96) = 24
24 is expressed in the form of 96m+72n
24 = 96 - 72×1
24 = 96 × 1 - 72 × 1
24 = 96(1) + 72(-1)
24 = 96m + 72n
Therefore, m = 1 and n = -1
Hope it helps
a = bq + r
0 ≤ r < b
Given numbers,
72 and 96
96 > 72
96 = 72(1) + 24
As the remainder is 24,we need to proceed further.
72 = 24(3) + 0
As remainder is 0,we can not proceed any further.
So,HCF of the given numbers is 24.
HCF (72,96) = 24
24 is expressed in the form of 96m+72n
24 = 96 - 72×1
24 = 96 × 1 - 72 × 1
24 = 96(1) + 72(-1)
24 = 96m + 72n
Therefore, m = 1 and n = -1
Hope it helps
Similar questions