Prove that if a and b are both odd integer

  • Thread starter Thread starter annoymage
  • Start date Start date
  • Tags Tags
    Integer
annoymage
Messages
360
Reaction score
0

Homework Statement



prove that if a and b are both odd integer, then 16|(a^2+b^2-2)

Homework Equations



n/a

The Attempt at a Solution



let a=2m+1 \ and \ b=2n+1, then a^2+b^2-2=4(m(m+1)+n(n+1)) so its divisible by 4, and also divisible 8 since m(m+1) \ and \ n(n+1) are even.
so i only prove 8|(a^2+b^2-2), then how to continue? clue please T_T
 
Physics news on Phys.org


hey I've got counter example, a=1 and b=3, so the question is wrong?
 


16\8=0 or am i wrong?
 


A thought..Let a^2 +b^2-2<> 16k. a^2+b^2<>16k+2 => a^2+b^2<>2m => odd +odd<> even which is wrong. (<> different from)
 


annoymage said:
hey I've got counter example, a=1 and b=3, so the question is wrong?

3^2+7^2-2=56. That isn't divisible by 16 either. Yes, there is something wrong with the question.
 
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