50 Questions • 40 Minutes • Quantitative Aptitude Mock Test in Hindi and English
• Step-by-step solution:
LCM of fractions = .
Numerators are , and . Their LCM is .
Denominators are , and . Their HCF is .
Result = .
• Exam Trick:
Since the options have different denominators, quickly check the LCM of the numerators (), which is . Only options with numerator are plausible. Then check the HCF of denominators (), which is . This directly gives .
• Step-by-step solution:
The fundamental rule of HCF and LCM is: .
.
.
Since , this simplifies to .
• Exam Trick:
Use the unit digit trick! The product of the unit digits of HCF and LCM () ends in . The product of the unit digits of the two numbers must also end in . The first number ends in . must end in . Look at the options: (ends in ). Option 1 () is the only one matching.
• Step-by-step solution:
The time after which the bells toll together again is the LCM of their individual intervals.
.
.
.
Time = .
• Exam Trick:
The largest number is . Multiples of are Check which is divisible by all. is divisible by , and . So LCM is seconds ( minute). Add it to the start time.
• Step-by-step solution:
The required number must perfectly divide .
These numbers are .
We need to find the HCF of , and .
The HCF is .
• Exam Trick:
The numbers to be divided are . Look at the difference between the first two numbers: . The HCF must be a factor of the difference (). Now check options: does not divide perfectly. The next largest factor of in the options is . Check if divides all three: , , . It works! So is the answer.
• Step-by-step solution:
First, find the LCM of the divisors , and .
.
The general form of the required number is .
For a -digit number, must be at least (since , which is -digit).
If , Number = .
• Exam Trick:
If the number leaves a remainder of when divided by , the number minus must be perfectly divisible by . Only option A () and option C () meet this. Since the question asks for the "smallest" 4-digit number, option A () is the winner.
• Step-by-step solution:
Let the common ratio multiplier be . The two numbers are and .
The LCM of and is .
We are given that , so .
The two numbers are and .
Their sum is .
• Exam Trick:
The sum of the two numbers is proportional to . This means the final sum must be a multiple of . Looking at the options (), is the ONLY number perfectly divisible by (). Solved without calculating the LCM!
• Step-by-step solution:
Let the two numbers be and , where and are co-prime integers.
According to the question, .
.
Now, we find pairs of co-prime numbers that sum up to :
The pairs are .
(Pairs like are not co-prime as they share a common factor ).
Thus, there are such pairs.
• Exam Trick:
No shortcut, standard method is already fastest. Just divide the sum by the HCF () and count the co-prime pairs. Remember that evens summing to an even number will share a factor of , so only odd pairs work for .
• Step-by-step solution:
Make the number of decimal places equal: , , and .
Now, temporarily remove the decimals and find the HCF of the integers .
The common factors are and . So, .
Since we adjusted for two decimal places, place the decimal back: .
• Exam Trick:
The HCF must perfectly divide the smallest number, . Eliminate as it is larger than . Test : and , so it does not divide . This leaves and . Since , works and is the highest.
• Step-by-step solution:
Convert dimensions to cm: Length = , Breadth = .
To find the minimum number of tiles, the size of each square tile must be maximum. This is the HCF of and .
Difference method for HCF: . Factors of are .
Since neither nor ends in or , is not a factor. Sum of digits of is (not div by ). Thus, HCF is .
Side of largest square tile = .
Number of tiles = .
• Exam Trick:
Unit digit shortcut: The number of tiles along the length is , which must end in (since ). The number of tiles along the breadth is , which must end in (since ). Total tiles = , so the final answer must end in . Only ends in !
• Step-by-step solution:
To find the LCM of algebraic expressions, multiply the LCM of their numerical coefficients by the highest power of each variable present.
Numerical coefficients: and . Their LCM is .
Variables:
Highest power of is .
Highest power of is .
Highest power of is (or just ).
LCM = .
• Exam Trick:
Visual inspection is enough here. Look for the largest number that and both divide into (which is ) and simply pick the highest exponents you see for every letter (). Distractor is actually the HCF, not LCM.
+ 40 more questions inside...