if n is an odd positive integer, show that (n2-1) divisible by 8
Answers
Answered by
11
We know that any odd positive integer is of the form 4q+1 or. 4q + 3 for some integer q.
So, we have the following cases:
Case I when n=4q+1
In this case, we have
n² - 1 = (4q + 1)² - 1 = 16q² + 8q + 1 – 1 = 16q² + 8q = 8q (2q + 1)
= n² - 1 is divisible by 8 [˙.˙ 8q(2q+1) is divisible by 8]
Case II when n=4q+3
In this case, we have
n² -1 = (4q + 3)² - 1 = 16q² + 24q + 9 – 1 = 16q² + 24q + 8
= n² - 1 = 8(2q² + 3q + 1) = 8(2q + 1 )(q + 1)
= n² - 1 is divisible by 8
Hence , n² - 1 is divisible by 8.
Answered by
0
Answer:
4Q² + 4Q = 4(1)² + 4(1) = 4 + 4 = 8 , it is divisible by 8
Step-by-step explanation:
this formula visible by 8 hope you understand
Similar questions