Using Euclid' algorithm ,find out the HCF of 272 and 1032.
Answers
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
272 = 216 × 1 + 56
216 = 56 × 3 + 48
56 = 48 × 1 + 8
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.
Answer:
Here it is. Please mark this as Brainliest.
Step-by-step explanation:
Doing the HCF by Euclid's Division Algorithm is very easy.
Firstly, write the no. greater than from the two no.s given. Use that no. as LHS, give an 'equal to' sign and then write in the RHS, the second no. Multiply how many times the the second no. divides the no. in the LHS exactly divides it. After dividing, add the leftover remainder at the last. After dividing, previous line's remainder will be our divisor and the previus line's divisor will be our dividend. We will do this till we don't get the remainder as zero. As and when, we'll get our remainder as zero, the no. first in the remainder will be our HCF.
1032= 272 x 3 + 216
272= 216 x 1 + 56
216= 56 x 3 + 48
56= 48 x 1 + 8
48= 8 x 6 + 0
Hence, HCF of 272 and 1032 is 8.
Hope so this helps.