
#1
Nov211, 09:08 AM

P: 18

1. The problem statement, all variables and given/known data
I need to be able to understand and likely prove that for any positive odd integer n, 8  (n^2 1 ) 2. Relevant equations 3. The attempt at a solution odd can be said to be n = 2k +1 so 8  (2k + 1)^2 1 



#2
Nov211, 09:14 AM

P: 2,080

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




#3
Nov211, 09:22 AM

P: 18

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




#4
Nov211, 09:56 AM

Mentor
P: 21,076

Prime Division HELP!!!
Try the approach that phyzguy is suggesting.



Register to reply 
Related Discussions  
prime division & repetition period  Linear & Abstract Algebra  1  
Simple Algebra question about division/prime factorizations  Calculus & Beyond Homework  3  
GPA of Upper Division & Lower Division courses and M.S degree  Academic Guidance  1  
Division with variables (I think I'd call this double division)  Precalculus Mathematics Homework  5  
Division theory..and Prime Number theory..  Linear & Abstract Algebra  3 