Question

use Euclids algorithm to find out HCF of 272 and 1032

Answer 1

HEY FRIEND

THE ANSWER OF YOUR QUESTION IS 8

Hope this finds you interesting

IF YOU THEN DONOT FORGET TO MAKE MY ANSWER BRAINLIST

Have Fun in Learning friend

See you soon

Answer 2

Answer:

HCF(1032,272)= 8

Step-by-step explanation:

Start with the larger integer, that is 1032, Apply the division Lemma to 1032 and 272, we get

1032 = 272 × 3 + 216

Since , the remainder 216 ≠ 0.

We apply the division Lemma to 272 and 216, we get

272 = 216 × 1 + 56

Remainder 56≠0

216 = 56 × 3 + 48

Remainder 48≠0

56 = 48 × 1 + 8

Remainder ≠ 0

48 = 8 × 6 + 0

The remainder has now become zero ,so our procedure stops.

Since , the divisor at this stage is 8 , the HCF of 1032 is 272 is 8.

•••♪