Math, asked by kabeer97, 11 months ago

2.1 Prove that n²- n is divisible by 2 for every positive integer n.​

Answers

Answered by swamygujjala68p2vykm
1

Any positive integer is of the form 2q or 2q+1, for some integer q

let n = 2q

n²-n = (2q)²-2q

= 2q(2q-1)

2m,when m=q(2q-1)

Which is divisible by 2

n = 2q+1

n²-n = (2q+1)(2q+1-1)

= 2q(2q+1)

2m, when m=q(2q+1)

Which is divisible by 2 hence ,n²-n is divisible by 2 for every positive integer n


kabeer97: Sir, if the question is divisible by 3
kabeer97: then we took 3q,3q+1?
swamygujjala68p2vykm: Sorry n^2 -n is not divisible by 3
swamygujjala68p2vykm: n^3-n is divisible by 3
swamygujjala68p2vykm: PlZ mark me as brainliest
kabeer97: No sir I am just asking that if the question is divisible by 3
kabeer97: how I can mark you as brainliest
swamygujjala68p2vykm: I am not your sir
kabeer97: you answered the questions, that's why
swamygujjala68p2vykm: ok
Similar questions