If 'n' is an odd integer, then show that n²-1 is divisible by 8.
#__PLEASE IGNORE THE QUESTION IF YOU DON'T KNOW THE ANSWER___#
Anonymous:
Is it legit to prove it.. taking some odd no. as example?
Yup
You can do that
Answers
Answered by
3
Example...
taking n as 3 and 5..
n^2 -1 = 3^2-1 = 9-1 = 8
n^2 -1 = 5^2-1= 25-1 =24
both are divisible by 8...
simultaneously taking the value of n as other odd integers... the answers are the multiples of 8...
taking n as 3 and 5..
n^2 -1 = 3^2-1 = 9-1 = 8
n^2 -1 = 5^2-1= 25-1 =24
both are divisible by 8...
simultaneously taking the value of n as other odd integers... the answers are the multiples of 8...
Thanks man ..... that was greatly appreciated :)
you're welcome bro ƪ(˘ᴗ˘)┐
Awesome Thanks
Answered by
4
Let n Be a positive odd number
So, n=4q+1
n²=16q²+8q+1
n²-1=16q²+8q which is divisible by 8
So, n=4q+1
n²=16q²+8q+1
n²-1=16q²+8q which is divisible by 8
Similar questions