Using Euclid’s division algorithm finds the HCF of 405, 840 and 960.
Answers
Answered by
24
first we divide 840 and 960
960/840 give 1 as quotient and 120 as remainder.
now according to algorithm,remainder becomes divider and divider become dividend.
so 840/120 gives 0 as remainder and 7 as quotient.
so hcf of 840 and 960 is 120.
now divide 120 by 45
remainder 30 quotient 2
now 30 becomes divider and 45 dividend.
45/30 gives 1 as quotient and 15 as remainder.
now 15 becomes divider and 30 as dividend.
30/15 gives 2 as quotient and 0 as remainder
According to euclid division algorithm 15 is hcf.
960/840 give 1 as quotient and 120 as remainder.
now according to algorithm,remainder becomes divider and divider become dividend.
so 840/120 gives 0 as remainder and 7 as quotient.
so hcf of 840 and 960 is 120.
now divide 120 by 45
remainder 30 quotient 2
now 30 becomes divider and 45 dividend.
45/30 gives 1 as quotient and 15 as remainder.
now 15 becomes divider and 30 as dividend.
30/15 gives 2 as quotient and 0 as remainder
According to euclid division algorithm 15 is hcf.
Answered by
4
Answer:
hhh
Step-by-step explanation:
dyfufuffu you have any questions or concerns
Similar questions