Question

Q. Use euclid division algorithms to find the hcf of :
1. 272 and 1032
2.405 and 2520
3.155 and and 1385
4.384 and 1296
5.1848 and 3058​

Answer 1

Answer:

use 1032 = 272(q) + r till you get r = 0. then the divisor of the last division is the HCF

Step-by-step explanation:

out of syllabus for 10th class. but still I know

it uses : dividend = divisor * quotient + reminder