Abhijit Guha Solutions for Chapter: HCF and LCM, Exercise 2: Practice Problems Level 2

Author:Abhijit Guha

Abhijit Guha Quantitative Aptitude Solutions for Exercise - Abhijit Guha Solutions for Chapter: HCF and LCM, Exercise 2: Practice Problems Level 2

Attempt the practice questions on Chapter 3: HCF and LCM, Exercise 2: Practice Problems Level 2 with hints and solutions to strengthen your understanding. Quantitative Aptitude for Competitive Examinations solutions are prepared by Experienced Embibe Experts.

Questions from Abhijit Guha Solutions for Chapter: HCF and LCM, Exercise 2: Practice Problems Level 2 with Hints & Solutions

EASY
CAT
IMPORTANT

Some sweets are to be distributed among 16, 40 and 70 boys. Find the minimum number of sweets required to be distributed so that no sweet is left.

EASY
CAT
IMPORTANT

The LCM of two numbers is 12 times their HCF. The sum of the HCF and the LCM is 403. If one of the numbers is 93, then the other number is:

EASY
CAT
IMPORTANT

Three numbers are in the ratio 2:3:4 and their HCF is 12. The LCM of the numbers is:

EASY
CAT
IMPORTANT

What is the least number, which when divided by the numbers 3, 5, 6, 8, 10 and 12 leaves in each case a remainder 2, but when divided by 13 leaves no remainder?

EASY
CAT
IMPORTANT

The least multiple of 13, which on dividing by 4, 5, 6, 7 and 8, leaves remainder 2 in each case is:

EASY
CAT
IMPORTANT

The HCF of three numbers is 24. If these numbers are in the ratio of 35:55:77, then what are these numbers?

EASY
CAT
IMPORTANT

The greatest number by which 1657 and 2037 are divided to give remainders 6 and 5, respectively is:

EASY
CAT
IMPORTANT

An electronic clock makes a beep after every 58 seconds. Another makes after every 60 seconds. They beeped together at 11.11 a.m.. The time when they would beep together next is: