Question

using Euclid algorithm find the hcf of 272 and 1032​

Answer 1

Answer:

HCF(1032,272)=8

Step-by-step explanation:

Start with larger integer, 1032, Apply division lemma to 1032 and 272 we get

1032=272×3+216

Since, the remainder 216 not equal to 0

we apply division lemma to 272 and 216, we get

272=216×1+56

Remainder 56 not equal to 0

216=56×3+48

Remainder 48 not equal to 0

56=48×1+8

Remainder 8 not equal to 0

48=8×6+0

The Remainder has now become zero, so our procedure stop

Answer 2

Yeh answer hota hai step -by step answer hai plz give me points and thanks