Proving the Divisibility of 8 and Odd Squares

  • Thread starter Thread starter PennState666
  • Start date Start date
  • Tags Tags
    Division Prime
PennState666
Messages
18
Reaction score
0
Prime Division HELP!

Homework Statement



I need to be able to understand and likely prove that for any positive odd integer n,
8 | (n^2 -1 )

Homework Equations





The Attempt at a Solution


odd can be said to be n = 2k +1
so 8 | (2k + 1)^2 -1
 
Physics news on Phys.org


Keep going. Now expand out (2k+1)^2 - 1 and collect terms. Then think about the terms in k and k+1.
 


I got stumped trying mathematical induction i was hoping for a new approach
 


Try the approach that phyzguy is suggesting.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top