Math, asked by amrits8847, 10 months ago

Use euclid algorithm to find HCF of 432 and 512

Answers

Answered by biligiri
1

Answer:

a = b q + r and 0 ≤ r < b

a = 512 , b = 432

512 = 432×1 + 80

432 = 80×5 + 32

80 = 32×2 + 16

32 = 16×2 + 0

as the remainder is 0, HCF of 432 and 512 is 16

Similar questions