LCM-HCF Quiz
MCQs on LCM (Least Common Multiple) and HCF (Highest Common factor) with detailed solution.
Total Questions=22
Time Duration: 20 minutes
Concepts Link: LCM & HCF
Connectez-vous à Google pour enregistrer votre progression. En savoir plus

The sum and the difference of the LCM and HCF of the two numbers are 312 and 264, respectively. Find the numbers if their sum is 168?

1 point
Effacer la sélection

A drink vendor has 80 liters of Mazza, 144 liters of Pepsi, and 368 liters of Sprite. He wants to pack them in cans, so that each can contains the same number of liters of a drink, and doesn’t want to mix any two drinks in a can. What is the least number of cans required?

1 point
Effacer la sélection
If the LCM of ‘a’ and ‘b’ is a & LCM of ‘b’ and ‘c’ is b, then what is the LCM of ‘c’ and ‘a’?
1 point
Effacer la sélection

LCM of two prime numbers x and y (x>y) is 161. The value of 3y-x is:

1 point
Effacer la sélection

How many pairs of positive integers x and y exist such that HCF(x,y) +LCM(x,y)= 91?

1 point
Effacer la sélection

The HCF and LCM of the two numbers are 11 and 385 respectively. If one number lies between 75 and 125, then that number is:

1 point
Effacer la sélection

Find the least five-digit number, which when divided by 12,18,21 and 28 leaves the same remainder?

1 point
Effacer la sélection

The product of two co-prime numbers added to their HCF gives us 91. How many such pairs are possible?

1 point
Effacer la sélection

How many pairs of integers (x,y) exist such that the product of x,y and HCF(x,y)= 1080?

1 point
Effacer la sélection

The greatest number which on dividing 1657 and 2037 leaves the remainder 6 and 5 respectively, is:

1 point
Effacer la sélection

Ram wants to utilize his unused field and plans to plant some trees, he plants 88 Guava, 132 Papaya, and 220 Sugarcane trees in equal rows (in terms of the number of trees). Also, he wants to make distinct rows of trees (i.e. only one type of tree in one row). Calculate the minimum number of rows?

1 point
Effacer la sélection

Find the least number that should be added to 2014 such that the resulting number can be divided by 3,4,5, and 6 leaving no remainder?

1 point
Effacer la sélection

The product of two numbers is 2028 and HCF is 13. The number of such pairs is:

1 point
Effacer la sélection

Find the least number which when divided by 5 leaves the remainder of 4, when divided by 6 leaves the remainder 5, when divided by 7 leaves 6, when divided by 8 leaves the remainder 7 and when divided by 9 leaves the remainder 8?

1 point
Effacer la sélection

Find the sum of the digits of the smallest 4-digit number which when divided by 4 leaves remainder 1, when divided by 5 leaves remainder 3 and when divided by 7 leaves remainder 2?

1 point
Effacer la sélection

If N is divided by 3,4,5 and 6 successively it leaves remainders 2,1,1 and 4 respectively.  How many such 4 digit numbers are possible?

1 point
Effacer la sélection

The H.C.F. of the two numbers is 27 and the two factors of their LCM are 12 and 15. What is the largest number?

1 point
Effacer la sélection

The LCM and HCF of the two numbers are 936 and 4 respectively. If one number is 72 then the other number is

1 point
Effacer la sélection

At 10 in the morning, 4 bells ring together. If they ring after 7, 8, 11, and 12 seconds respectively, how many times will they ring together again in the next 12 hours?

1 point
Effacer la sélection

If the HCF and LCM of some numbers like 2472, 1248, and N, etc. are 12 and 2^3×3^2×5×103×107 respectively, then what can be the value of N?

1 point
Effacer la sélection

What is the minimum number of square tiles required to pave the floor of a room 15 m 17 cm long and 9 m 2 cm broad?

1 point
Effacer la sélection

Three runners start running around a circular track at 5 am. They can complete one round in 2, 4, and 5.5 minutes respectively. When will they meet at the starting point?

1 point
Effacer la sélection
Envoyer
Effacer le formulaire
Ce contenu n'est ni rédigé, ni cautionné par Google. Signaler un cas d'utilisation abusive - Conditions d'utilisation - Règles de confidentialité