Tamilnadu BoardEnglish MediumSTD 10MATHSNumbers and Sequences5 Marks
Question
Prove that $n^2-n$ divisible by 2 for every positive integer $n$
✓
Answer
To prove $n ^2- n$ divisible by 2 for every positive integer n .
We know that any positive integer is of the form $2 q$ or $2 q+1$, for some integer $q$. So, following cases arise:
Case I:
When $n =2 q$.
In this case, we have
$n^2-n=(2 q)^2-2 q=4 q^2-2 q=2 q(2 q-1)$
$\Rightarrow n^2-n=2 r \text { where } r=q(2 q-1)$
$\Rightarrow n^2-n \text { is divisible by } 2$
Case II:
When $n=2 q+1$
In this case, we have
$n^2-n=(2 q+1)^2-(2 q+1)$
$=(2 q+1)(2 q+1-1)=(2 q+1) 2 q$
$\Rightarrow n^2-n=2 r \text { where } r=q(2 q+1)$
$\Rightarrow n^2-n \text { is divisible by } 2$
Hence $n^2-n$ is divisible by 2 for every positive integer $n$.
Need a full question paper?
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.