Home
Class 10
MATHS
Use Euclid Division Algorithm to find th...

Use Euclid Division Algorithm to find the Highest Common Factor (H.C.F) of
10224 and 9648

Text Solution

Verified by Experts

The correct Answer is:
`144`
Promotional Banner

Topper's Solved these Questions

  • NUMBER AND SEQUENCES

    SURA PUBLICATION|Exercise EXECRISE 2.2|9 Videos

  • NUMBER AND SEQUENCES

    SURA PUBLICATION|Exercise EXECRISE 2.3|14 Videos

  • MENSURATION

    SURA PUBLICATION|Exercise Unit Test (Section -C)|2 Videos

  • ONE MARK QUESTIONS SET

    SURA PUBLICATION|Exercise Multiple Choice Question|250 Videos

Similar Questions

Explore conceptually related problems

Use Euclid Division Algorithm to find the Highest Common Factor (H.C.F) of 340 and 412

Use Euclid Division Algorithm to find the Highest Common Factor (H.C.F) of 867 and 255

Use Euclid Division Algorithm to find the Highest Common Factor (H.C.F) of 84, 90 and 120

Use Euclid's division algorithim to find the HCF of 867 and 255.

Use Euclid's algorithm to find the HCF of 900 and 270

Use Euclid's algorithm to find the HCF of 4053 and 12756.

Use Euclid's algorithm to find the HCF of 196 and 38220