Proving Divisibility of (n^2-1) for Odd Integers n

  • Thread starter Thread starter scott_bruenin
  • Start date Start date
  • Tags Tags
    Proof
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
1 reply · 4K views
scott_bruenin
Messages
1
Reaction score
0

Homework Statement


For each integer n, if n is odd then 8[tex]\left|[/tex] (n[tex]^{2}[/tex]-1)


Homework Equations


Def of an odd number 2q+1


The Attempt at a Solution



(2q+1)[tex]^{2}[/tex] -1
4q[tex]^{2}[/tex] +4q+1-1
4q[tex]^{2}[/tex] +4q
Here is where I get stuck... should I factor out the 4 and say that q[tex]^{2}[/tex] +q is an integer and therefore can be wrote as some integer r and therefore 8[tex]\left|[/tex] 4r?
 
Physics news on Phys.org
Can you show q^2+q is divisible by 2 for any integer q? If so, then 4q^2+4q is divisible by 8.