Shortcut Trick
The required number must be of the form: LCM(9, 18, 23) × k + 5.
The LCM of 9, 18, and 23 is 414.
The largest 4-digit number is 9999. Dividing 9999 by 414 gives a quotient of 24 and a remainder of 63.
Largest 4-digit multiple of 414 = 9999 − 63 = 9936.
Required number = 9936 + 5 = 9941.
∴ The correct answer is 9941.
Alternate Method
Given:
Divisors: 9, 18, and 23
Remainder in each case = 5
Formula Used:
Required Number = [Largest 4-digit multiple of LCM of the divisors] + Remainder
Calculations:
⇒ First, find the prime factorization to calculate the LCM of 9, 18, and 23.
⇒ 9 = 32
⇒ 18 = 2 × 32
⇒ 23 = 23 (Prime number)
⇒ LCM = 2 × 32 × 23 = 18 × 23 = 414
⇒ The largest 4-digit number is 9999.
⇒ Divide 9999 by the LCM (414) to find the largest multiple within the 4-digit range.
⇒ 9999 ÷ 414 = 24 with a remainder of 63.
⇒ The largest 4-digit multiple of 414 = 9999 − 63 = 9936.
⇒ This implies that 9936 is completely divisible by 9, 18, and 23.
⇒ Since we need a remainder of 5 in each case, we add 5 to this multiple.
⇒ Required number = 9936 + 5 = 9941.
∴ The correct answer is 9941.
Additional Information
LCM Method for Same Remainder
When a number is divided by a, b, and c leaving the same remainder r in each case, the general form of that number is LCM(a, b, c) × k + r.
LCM Method for Different Remainders
When a number divided by a, b, and c leaves remainders x, y, and z respectively, and the differences (a−x) = (b−y) = (c−z) = d are equal, the number is in the form LCM(a, b, c) × k − d.
HCF for Same Remainder
The greatest number that divides x, y, and z leaving the same remainder in each case is the HCF of |x−y|, |y−z|, and |z−x|.