Shortcut Trick
Smallest number = LCM(6, 7, 8, 9, 12) + Remainder
LCM of 6, 7, 8, 9, 12 = 504
Required number = 504 + 2 = 506
∴ The correct answer is 506.
Alternate Method
Given: Divisors = 6, 7, 8, 9, 12; Remainder = 2
Formula: Number = [LCM of divisors] × k + Remainder
⇒ Prime factors of 6 = 2 × 3
⇒ Prime factors of 7 = 7
⇒ Prime factors of 8 = 23
⇒ Prime factors of 9 = 32
⇒ Prime factors of 12 = 22 × 3
⇒ LCM = 23 × 32 × 7 = 8 × 9 × 7 = 504
⇒ Smallest number = 504 + 2 = 506
∴ The correct answer is 506.
Additional Information
LCM (Least Common Multiple)
The smallest positive integer that is divisible by each of the given numbers without leaving a remainder.
Remainder Property
When a number N leaves a constant remainder 'r' when divided by a, b, and c, then N = LCM(a, b, c) × k + r.
Divisibility Rule of 9
A number is divisible by 9 if the sum of its digits is divisible by 9. In this question, 506 ÷ 9 gives remainder 2 (5+0+6=11; 11−9=2).