Dear all,
I can’t understand the explanation of the "theory method#1" in this thread by RonPurewal :
remainder-gmat-prep-t5779.html
Here is the question again:
If n is a positive integer and r is the remainder when 4+7n is divided by 3, what is the value of r?
1) n+1 is divisible by 3
2) n>20
The second statement is easy. Drop it.
However I stuck with the first one.
If we write n+1=3k then n=3k-1 and then put this equation in 4+7n, therefore 4+7*(3k-1)=
4+21k-7=
21k-3=
3(7k-1).
Consequently, 4+7n is a multiple of 3, which means that the remainder always be 0.
If this works out, then the 1st statement is sufficient. However, you see that plugging the numbers less then 20, there will be different remainders. Where is logic then?
Could somebody help to understand where I go wrong? Maybe I miss something?
Thx in advance