Number Theory divisibility proof

jersiq1
Messages
7
Reaction score
0

Homework Statement


Prove that for any n \in Z+, the integer (n(n+1)(n+2) + 21) is divisible by 3


Homework Equations



A previously proved lemma (see below)

The Attempt at a Solution



I sort of just need a nudge here. I have a previously proven lemma which states:

If d|a and d|b, then d|(a+b)

So armed with this I see that obviously 3|21 and all that remains is to prove n(n+1)(n+2) is divisible by 3. I have tried expanding, which didn't seem to help.
 
Physics news on Phys.org
n(n+1)(n+2) is the product of __ consecutive integers.
 
Wow! staring me in the face. Thanks.
 
Cheers :)
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top