Use Euclid's algorithm of find the HCF of 272 and 1032.

Explanation

We find HCF (272, 1032) using the following steps.
Step 1. since `1032 gt 272` , we
divide 1032 by 272 to get 3 as quotient and 216 as remainder.
So, by Eucid's divison lemma, we get
1032 =` 272 xx 3 + 216`
Step 2. since the remainder ` 216 ne 0` , we divide 272 by 216 to get 1 as quotient and 56 as remainder .
by Euclid's divison lemma, we get
` 272 = 216 xx 1+56`
Step 3. Since the remainder ` 56 ne 0` , we divide 216 by 56 to get 3 as quotient and 48 as remainder.
by Eulid's divison lemma, we get
`216 = 56 xx3 + 48`
Step 4. Since the remaider `48 ne 0` we divide 56 by 48 to get 1 as quotient and 8 as remainder.
by Euclid's division lemma, we get
` 56 = 48xx 1 +8`
Step 5. Since the remainder ` 8 ne 0` , we divide 48 by 8 to get 6 as quotient and 0 as remainder.
` 48 = 8xx 6+0`
The remainder has now become 0, so our procedure stops.
Hence, HCF ( 272 , 1032)=8