Q1. Use Euclid’s algorithen to find the HCF
420 and 272

Q1. Use Euclid’s algorithen to find the HCF
420 and 272

About the author
Madelyn

2 thoughts on “Q1. Use Euclid’s algorithen to find the HCF<br />420 and 272<br />​”

  1. Here, 420>272

    ∴,

    420=272×1+148

    272=148×1+124

    148=124×1+24

    124=24×5+4

    24=4×6+0

    Since the remainder is 0, thus the HCF is 4.

    The prime factorization of 420 and 272 are:

    420=2×2×3×5×7

    272=2×2×2×2×17

    ∴, HCF=2×2=4

    Reply

Leave a Comment