Q.

If n is an odd integer, then show that n 2 1    is divisible by


see full answer

Start JEE / NEET / Foundation preparation at rupees 99/day !!

21% of IItians & 23% of AIIMS delhi doctors are from Sri Chaitanya institute !!
An Intiative by Sri Chaitanya

a

3

b

6

c

8

d

7     

answer is C.

(Unlock A.I Detailed Solution for FREE)

Ready to Test Your Skills?

Check your Performance Today with our Free Mock Test used by Toppers!

Take Free Test

Detailed Solution

It is given that n   is an odd integer.
According to Euclid’s division lemma,
Given positive integers say a and b, there exist unique integers q and r which satisfies
a=bq+r, where 0r<m.
Since n   is an odd integer.
n=1,3,5,...   .
So, for n=1,
n2-1=1-1=0 Here, n 2 1   is divisible by 8.
For n=3,
n2-1=9-1=8  Here, n 2 1   is divisible by 8.
For n=5,
n2-1=25-1=24 Here, 24 is divisible by 8.
So, n 2 1   is divisible by 8.
Hence, it is proved that n   is an odd integer, then n 2 1  is divisible by 8.
Therefore, the correct option is 3.
 
Watch 3-min video & get full concept clarity
score_test_img

Get Expert Academic Guidance – Connect with a Counselor Today!

whats app icon