5. Prove that n^2-n is divisible by 2 for every positive integer'n' ?
Answers
Answered by
2
Answer:
Step-by-step explanation:
= n(n-1)
=(n)(n-1) . . . .(i)
let n is even = 2q
=2m (where m is multiple of)
let n is odd = 2q +1
n(n-1) = (2q + 1) (2q + 1 -1)
=(2q-1) (2q)
=2m ( " )
hence is divisible by 1 for any positive integer n
hope this helps
mark as brainliest
(+_+)
Similar questions