Can a Basis Be Proven with Divisibility?

  • Thread starter Thread starter penguin007
  • Start date Start date
  • Tags Tags
    Arithmetic Basis
penguin007
Messages
75
Reaction score
0

Homework Statement


Hi everyone.
I'm studying a problem and I need to prove that I have a basis. I tryed a proof and to achieve it I need to show that :

if k divides a*b and also divides a2 +2*b2 Then k divides both a and b.


Homework Equations



I'm not sure what I'm asserting is true but if it was, then it would be great for me ( cause my proof would be finished).
I first thought that if k divided a sum then it divided every term of that sum but I understood it was wrong (the other way is correct).

I'm taking any idea!
 
Physics news on Phys.org


No, what if a = b and k = a2 in general?
 


Tedjn said:
No, what if a = b and k = a2 in general?

That's right indeed. But what if k is prime??
 


If k = 2, then no. Why? If k > 2 is prime, then yes. Why? Use the property that if p is prime and divides ab, then it divides a or b.
 


I can see if k>2, thank you, but why is it wrong if k=2 ?
 


Let a be even and b be odd.
 
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