Question #4310

if x and y are prime to 3, prove that x^2 + y^@ cannot be a perfect square
1

Expert's answer

2011-10-13T12:36:01-0400

Let n=3m+k,k=0,2,n,mNn = 3m + k, k = \overline{0,2}, \forall n, m \in N.

Then n2=9m2+6mk+k2={9m29m2+6m+19m2+12m+4={3(3m2)3(3m2+3m)+13(3m2+4m+1)+1n^2 = 9m^2 + 6mk + k^2 = \begin{cases} 9m^2 \\ 9m^2 + 6m + 1 \\ 9m^2 + 12m + 4 \end{cases} = \begin{cases} 3(3m^2) \\ 3(3m^2 + 3m) + 1 \\ 3(3m^2 + 4m + 1) + 1 \end{cases}, k=0k = 0, k=1k = 1, k=2k = 2.

Hence, n2=3l+k,k=0,1,n,lNn^2 = 3l + k, k = \overline{0,1}, \forall n, l \in N. But nn is prime to 3, hence, n2n^2 is prime to 3 and in our case n2=3l+1,n,lNn^2 = 3l + 1, \forall n, l \in N.

Consider x2+y2=(3u+1)2+(3v+1)2=9u2+6u+1+9v2+6v+1=3(3u2+3v2+2u+2v)+2x^{2} + y^{2} = (3u + 1)^{2} + (3v + 1)^{2} = 9u^{2} + 6u + 1 + 9v^{2} + 6v + 1 = 3(3u^{2} + 3v^{2} + 2u + 2v) + 2.

Hence, x2+y2=3w+2x^{2} + y^{2} = 3w + 2. But we proved, that the square of natural number can have remainder equal to 0 or 1 and in our case it equal to 2. Then x2+y2x^{2} + y^{2} can't be a perfect square.

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS