more discrete math help
I have my final on Monday so I need some help.
I want to make sure this makes sense to those out there that know the subject
Prove of Disprove that n^3+2n is divisible by 2 ; n >= 2 (n is greater than or equal to 2)
I want to disprove that the equation is divisible by 2 but I think my method I have now wont fly.
n = 3
3^3 + 2(3) = 33 which is not divisible by 2 thus disproving it. But that is only one case, which is why I think it will not fly.
help? I believe induction might need to be used.
|