SOLUTION: Given that n^2 + n = 2k, how can (n+1)^2 + (n+1) be written as a multiple of 2?

Question 74358: Given that n^2 + n = 2k, how can (n+1)^2 + (n+1) be written as a multiple of 2?
Answer by stanbon(75887) (Show Source): You can put this solution on YOUR website!
Given that n^2 + n = 2k,
n(n+1)=2k
how can (n+1)^2 + (n+1) be written as a multiple of 2?
--------------
(n+1)^2 + (n+1)
=(n+1)[n+1+1
=n(n+1+1)+(n+1+1)
=n(n+1) +n +n+2
=n(n+1) +2(n+1)
=2k +2(n+1)
=2[k+n+1]
which is a multiply of 2
------------
Cheers,
Stan H.
RELATED QUESTIONS
n(n+1)(n+2)is a multiple of 6. (answered by MathLover1)

prove that a perfact number can be written as a sum of (2^n)-1 consicutine numbers for... (answered by richard1234)

Prove the following statement. If n=m^3-m for some integer m, then n is a multiple of... (answered by jsmallt9)

prove that a perfact number can be written as a sum of (2^n)-1 consicutive numbers for... (answered by richard1234)

Will n! +2, n! +3,..., n! +n for n>=2 always be a sequence of n-1 composite numbers?... (answered by jim_thompson5910)

n!(n+2)=n!+(n+1)! (answered by LinnW)

Show that (n + 1)^2 is a divisor of (n + 1)! + n! + (n -... (answered by tommyt3rd)

Is there a value of n such that n^2 + n + 1 is a multiple of... (answered by Stitch)

prove that : n! (n+2) = n! +... (answered by tommyt3rd)