Prove that n2-n is divisible by 2 for every positive integer n.
Answers
Answered by
1
Answer:
Step-by-step explanation:
Case i: Let n be an even positive integer.
When n=2q
In this case , we have
for any integer
it is multiple of 2
therefore it is divisible by 2
Case ii: Let n be an odd positive integer.
When n=2q+1
In this case
for any integer
it is multiple of 2
therefore it is divisible by 2
Similar questions