Abhijit Guha Solutions for Chapter: HCF and LCM, Exercise 2: Practice Problems Level 2
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
Some sweets are to be distributed among and boys. Find the minimum number of sweets required to be distributed so that no sweet is left.

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

Three numbers are in the ratio and their HCF is . The LCM of the numbers is:

What is the least number, which when divided by the numbers and leaves in each case a remainder , but when divided by leaves no remainder?

The least multiple of , which on dividing by and , leaves remainder in each case is:

The HCF of three numbers is . If these numbers are in the ratio of , then what are these numbers?

The greatest number by which and are divided to give remainders and , respectively is:

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