using euclid division algorithm find whether the pair of numbers 847,2160 are co prime or not
Answers
Answered by
17
Heya!
Here is yr answer......
According to Euclid's division algorithm....
2160 = 847 × 2 + 466
847 = 466 × 1 + 381
466 = 381 × 1 + 85
381 = 85 × 4 + 41
85 = 41 × 2 + 3
41 = 3 × 13 + 2
3 = 2 × 1 + 1
2 = 1 × 2 + 0
847 , 2160 are co-primes.... bcuz , HCF is 1
Hope it hlpz..
Here is yr answer......
According to Euclid's division algorithm....
2160 = 847 × 2 + 466
847 = 466 × 1 + 381
466 = 381 × 1 + 85
381 = 85 × 4 + 41
85 = 41 × 2 + 3
41 = 3 × 13 + 2
3 = 2 × 1 + 1
2 = 1 × 2 + 0
847 , 2160 are co-primes.... bcuz , HCF is 1
Hope it hlpz..
Riyagrover:
plzz explain what are co prime numbers
The nos. which don't have any common factor... except 1
ok again thanks
wlcm
I have one more question. Can i asked
ask
ok..
using prime factorisation method find hcf and lcm of 30,72 and 432. also show that hcf×lcm is not equal to their products
i will answer... in yr ques... see there
isme lcm and hcf aa gya lcm 2160 and hcf 6. after this i dont understand how to show last line
Answered by
1
Answer:
according to Euclid division algorithm2160>847
2160=847×2+466
847=466×1+381
381=85×4+41
85=41×2+3
41=3×13+2
3=2×1+1
2=1×2+0
since, remainder is 0 therefore HCF is 1
therefore, 847 and 2160 are coprime
Similar questions