Math, asked by divya311, 11 months ago

show that n2+n is divisible by 2for every​


Ankitgodara20: hi divya

Answers

Answered by bharti7267
1
first \: lets \: check \:for \: n = 1 \\ \: 1.2 + 1 = 3 \: which \: <br />is \: not \: <br />divisible \: by \: 2 \\ so \: your \: ques \: is <br />\: wrong \: dude \: check \: again

Ankitgodara20: hllo bharyi
Ankitgodara20: barti
bharti7267: hy
Ankitgodara20: how are you
bharti7267: fine
Ankitgodara20: hlo
Answered by kingaj001744
2

Answer:

Here is the answer to your question.

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

When n = 2q, 

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

     =4q²+2q

     = 2q(2q+1)   

which is divisible by 2

 

when n=2q+1

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

     = 4q²+4q+1+2q+1

     =4q²+6q +2

    =  2(2q²+3q+1)

which is divisible by 2

hence n²+n is divisible by 2 for every positive integer n

Similar questions