Question

use euclid division lemma to show that n²—n divisible by 2 for n any positive integer solve this question

Answer 1

If we take n=2 then

n^2-n will be

=2^2-2
=4-2
=2
this is divisible by 2

Now take n=4,then

=2^4-4
=16-4
=12
this is also divisible by 2

So from this we can conclude that it doesn't matter what positive value you take for n but n2-n is always divisible by 2

FOLLOW ME FOR MORE HELP!