Shortcut Trick
The required number must be of the form: LCM(11, 7, 14) × k + 2.
LCM of 11, 7, and 14 = 154.
Largest 4-digit multiple of 154: 154 × 64 = 9856.
Required number = 9856 + 2 = 9858.
∴ The correct answer is 9858.
Alternate Method
Given: Divisors = 11, 7, 14; Remainder = 2 in each case; Target = Largest 4-digit number.
Step 1: Calculate the LCM of the given divisors.
⇒ Prime factorization: 11 = 111, 7 = 71, 14 = 2 × 7 ⇒ LCM(11, 7, 14) = 11 × 2 × 7 = 154
Step 2: Find the largest 4-digit multiple of 154.
⇒ Largest 4-digit number = 9999 ⇒ 9999 ÷ 154 → Quotient = 64, Remainder = 143 ⇒ Largest multiple = 9999 − 143 = 9856
Step 3: Add the common remainder to the multiple.
⇒ Required number = 9856 + 2 = 9858
∴ The correct answer is 9858.
Additional Information
General Remainder Theorem
For a number that leaves the same remainder 'r' when divided by a, b, and c, the general form is LCM(a, b, c) × k + r.
Divisibility Rule of 7
Double the last digit and subtract it from the remaining number; if the result is divisible by 7, the original number is also divisible by 7.
Divisibility Rule of 11
A number is divisible by 11 if the difference between the sum of digits at odd places and the sum of digits at even places is 0 or a multiple of 11.