- #1
dobedobedo
- 28
- 0
Modulus problem[solved]
I would like to know how to prove that the number n^3 + 2n is divisible by 3 for all integers n. I know that I am supposed to examine the possible remainders after division with 3. The possibilities are:
n= 0,1,2 (mod 3)
Could somebody please help me? How can the expression of n^3 + 2n possibly become a number composed by at least one factor 3?
Thank you by forehand,
dobedobedo
I would like to know how to prove that the number n^3 + 2n is divisible by 3 for all integers n. I know that I am supposed to examine the possible remainders after division with 3. The possibilities are:
n= 0,1,2 (mod 3)
Could somebody please help me? How can the expression of n^3 + 2n possibly become a number composed by at least one factor 3?
Thank you by forehand,
dobedobedo
Last edited: