Given that:
Is it true that:
is also not divisible by 3?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The two numbers a and b will have to be of the form of 3n+1 and 3k+2 respectively. (Since they give different non-zero remainders when divided by 3; here n and k are whole numbers)
Thus, a + b= 3(n+k) + 1 + 2 = 3(n+k+1), which is always divisible by 3.