Using Euclid's division algorithm, find the H.C.F. of 240 and 6552.

Question

TextHCF Using Prime Factorisation Method

Loading...

Similar Questions

If x = ab³ and y = a³b, where a and b are prime numbers, then [HCF (x, y) – LCM (x, y)] is equal to :

MCQ (Single)HCF Using Prime Factorisation MethodLCM Using Prime Factorisation Method

Prove that √2 is an irrational number.

Text

HCF Using Prime Factorisation Method

LCM Using Prime Factorisation Method

Relationship Between HCF and LCM of Two Numbers

Irrationality of Square Root of Prime Numbers

Proof by Contradiction Method

HCF Using Prime Factorisation Method

LCM Using Prime Factorisation Method

Relationship Between HCF and LCM of Two Numbers

Irrationality of Square Root of Prime Numbers

Proof by Contradiction Method

Let x and y be two distinct prime numbers and p = x²y³, q = xy⁴, r = x⁵y². Find the HCF and LCM of p, q and r. Further check if HCF (p, q, r) × LCM (p, q, r) = p × q × r or not.

TextHCF Using Prime Factorisation MethodLCM Using Prime Factorisation MethodRelationship Between HCF and LCM of Two NumbersIrrationality of Square Root of Prime NumbersProof by Contradiction Method

The HCF of 40, 110 and 360 is :

MCQ (Single)HCF Using Prime Factorisation Method

The HCF and the LCM of 12, 21, 15 respectively is

MCQ (Single)HCF Using Prime Factorisation MethodLCM Using Prime Factorisation Method

The greatest possible speed at which a man can walk 135 km and 225 km in exact number of hours is:

MCQ (Single)HCF Using Prime Factorisation Method