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
340 and 412

Text Solution

Verified by Experts

The correct Answer is:
(i) HCF of 340 and 412 is 4.
(ii) HCF of 867 and 255 is 51
(iii) HCF of 1024 and 9648 is 144.
(iv) HCF of 84, 90 and 120 is 6
Promotional Banner

Topper's Solved these Questions

  • NUMBERS AND SEQUENCES

    FULL MARKS|Exercise EXERCISE 2.2|8 Videos

  • NUMBERS AND SEQUENCES

    FULL MARKS|Exercise EXERCISE 2.3|10 Videos

  • NUMBERS AND SEQUENCES

    FULL MARKS|Exercise ADDITIONAL QUESTION SOLVED (III. ANSWER THE FOLLOWING).|12 Videos

  • MENSURATION

    FULL MARKS|Exercise ADDITIONAL QUESTIONS SOLVED (iii)|8 Videos

  • RELATIONS AND FUNCTIONS

    FULL MARKS|Exercise ADDITIONAL QUESTIONS SOLVED (ANSWER THE FOLLOWING QUESTIONS)|26 Videos

Similar Questions

Explore conceptually related problems

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

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

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

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