Question

prove that n2-n is divisible by 2 for every +ve integer
n​

Answer 1

Answer:

by Euclids division lemma

Step-by-step explanation:

a=bq+r

Therefore n=bq+r

if r= 0, n=2q

n^2-n = 2q ^2 -2q

n^2-n= 4q^2-2q

n^2=2(2q^2-q)

Therefore it is divisible by 2.

hence proved

Answer 2

Answer:

Step-by-step explanation:

dont know do it yourself \\