by RonPurewal Thu Sep 16, 2010 7:55 am
the above solutions aren't good enough, actually; in these kinds of problems, you can't just pick one value and watch what happens. in order to be convinced that the pattern is genuine, you would have to pick a succession of numbers that satisfies each of the statements, and make sure that you keep getting the same remainder every time.
so, you should try at least a few values -- 3, 15, 27, 39, etc. -- until you are satisfied that the pattern is going to continue indefinitely.
--
here's a theory-based approach:
if k leaves a remainder of 3 when it is divided by 12, then you can write k = 12n + 3 (where n is an integer).
(i) 2k = 24n + 6.
since 24n is a multiple of 12, this will have an overall remainder of 6 when you divide it by 12.
(ii) 6k = 72n + 18.
= 72n + 12 + 6.
since 72n and 12 are multiples of 12, this will have an overall remainder of 6 when you divide it by 12.
(iii) 4k + 6 = (48n + 12) + 6 = 48n + 18.
= 48n + 12 + 6.
since 48n and 12 are multiples of 12, this will have an overall remainder of 6 when you divide it by 12.
so, all three of them.