Find the HCF of 660 and 252 by using Euc...

Find the HCF of 660 and 252 by using Euclid’s division algorithm and verify it by using prime factorisation m ethod.

Verified by Experts

The correct Answer is:

12

REAL NUMBERS
KUMAR PRAKASHAN|Exercise EXERCISE 1.1|5 Videos
REAL NUMBERS
KUMAR PRAKASHAN|Exercise EXERCISE 1.2|7 Videos
REAL NUMBERS
KUMAR PRAKASHAN|Exercise TEST YOUR SKILLS|26 Videos
QUESTION PAPER-2
KUMAR PRAKASHAN|Exercise Section C|14 Videos
SOME AAPLICATIONS OF TRIGONOMETRY
KUMAR PRAKASHAN|Exercise Objective Questions|24 Videos

Similar Questions

Explore conceptually related problems

Find the HCF of 195, 416 and 637 by using Euclid’s division algorithm.

Find the HCF of the following by using Euclid algorithm. 300 and 550

Find the HCF of the following by using Euclid algorithm. 96 and 72

Find the HCF of the following by using Euclid algorithm. 50 and 70

Find the HCF of the following by using Euclid algorithm. 1860 and 2015

Using Euclid’s division algorithm, find the HCF of 5404 and 4800

Find the LCM and HCF of 6 and 20 by the prime factorisation method.

Using Euclid’s division algorithm, find the HCF of 441, 567 and 693.

Find the HCF and LCM of 6, 72 and 120, using the prime factorisation m ethod.

Find the HCF and LCM of 12, 72 and 120 by prime factorisation method.