wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

PROVE THAT (n2-n)IS DIVISIBLE BY 2 FOR EVERY POSITIVE INTEGER n

Open in App
Solution

Casei: Let n be an even positive integer.
When n = 2q
In this case , we have
n2 - n = (2q)2 - 2q = 4q2 - 2q = 2q (2q - 1 )
n2 - n = 2r , where r = q (2q - 1)
n2 - n is divisible by 2 .

Case ii: Let n be an odd positive integer.
When n = 2q + 1
In this case
n2 -n = (2q + 1)2 - (2q + 1)= (2q +1) ( 2q+1 -1)= 2q (2q + 1)
n2 - n = 2r , where r = q (2q + 1)
n2 - n is divisible by 2.

∴ n 2 - n is divisible by 2 for every integer n

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
B.2.1 How Transpiration Occurs
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon