Concept:Find a number that is a multiple of 11 and leaves remainder 5 when divided by 6, 12, 15, 18. Use LCM and modular arithmetic.
Explanation:First, find the least common multiple (LCM) of 6, 12, 15, 18.
Prime factorize:
6=2×3,
12=22×3,
15=3×5,
18=2×32.
LCM =
22×32×5=4×9×5=180.
The number
N satisfies:
N≡5(mod180), so
N=180K+5 for some integer
K≥0.
Also,
N must be a multiple of 11:
180K+5 is divisible by 11.
Check values of
K from 0 upward until divisible by 11.
K=0:
180×0+5=5 (not divisible by 11).
K=1:
185,
185÷11=16.81 (not integer).
K=2:
365,
365÷11=33.18.
K=3:
545, not integer.
K=4:
725, not.
K=5:
905, not.
K=6:
1085,
1085÷11=98.636.
K=7:
1265,
1265÷11=115 (exact).
Thus the least
K that works is
K=7, giving
N=1265.
Verify:
1265 remainder when divided by 6 is
5?
1265÷6=210×6=1260, remainder
5. Similarly for 12, 15, 18 gives remainder 5. So
N=1265 is correct.
Now
1265 lies between
1200 and
1300.
Answer:1200<N<1300, so option D is correct.