Prove: If an Integer is a Sum of Squares, its Square is Also a Sum of Squares

  • MHB
  • Thread starter anemone
  • Start date
  • Tags
    2016
In summary, to prove that an integer is a sum of squares if its square is also a sum of squares, we can use the Pythagorean theorem. This statement can be represented visually using a geometric proof or proven algebraically. It holds true for all integers and has real-world applications in geometry, number theory, and physics.
  • #1
anemone
Gold Member
MHB
POTW Director
3,883
115
Here is this week's POTW:

-----

Suppose $a$ is an integer that is a sum of squares of three positive integers. Prove that $a^2$ is also a sum of squares of three positive integers.

-----

Remember to read the http://www.mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to http://www.mathhelpboards.com/forms.php?do=form&fid=2!
 
Physics news on Phys.org
  • #2
No one answered last week problem. :(

You can see the proposed solution as follows:

Let $a=p^2+q^2+r^2$.

Therefore

$\begin{align*}a^2&=(p^2+q^2+r^2)^2\\&=p^4+q^4+r^4+2p^2q^2+2q^2r^2+2r^2p^2\\&=(p^4+q^4+r^4+2p^2q^2-2q^2r^2-2r^2p^2)+4q^2r^2+4r^2p^2\\&=(p^2+q^2-r^2)^2+(2pr)^2+(2qr)^2\end{align*}$

Without loss of generality, we may assume $p^2 \ge q^2\ge r^2$, so we have $p^2+q^2-r^2\ge 0$ and this completes the proof.
 

FAQ: Prove: If an Integer is a Sum of Squares, its Square is Also a Sum of Squares

How can I prove that if an integer is a sum of squares, its square is also a sum of squares?

To prove this statement, we can use the Pythagorean theorem. Let n be the integer that is a sum of squares, and let x and y be the two integers that make up the sum. Then, according to the Pythagorean theorem, n^2 = x^2 + y^2. This shows that the square of n is also a sum of squares, specifically x^2 and y^2.

Can you provide a visual representation of this statement?

Yes, we can represent this statement using a geometric proof. We can draw a right triangle with sides x and y, and the hypotenuse being n. This triangle will have an area of x^2 + y^2, which is the sum of squares. By squaring n, we create a larger square with an area of n^2. However, we can also divide this larger square into smaller squares with areas of x^2 and y^2. This visually shows that n^2 is also a sum of squares.

Can this statement be proven with algebraic equations?

Yes, this statement can also be proven using algebraic equations. We can start by representing n as the sum of two integers, x and y. Then, we can square both sides to get n^2 = (x + y)^2. Expanding the right side, we get n^2 = x^2 + 2xy + y^2. Since x and y are both integers, 2xy must also be an integer. Therefore, n^2 is the sum of x^2, y^2, and 2xy, which are all integers and therefore also sums of squares.

Does this statement hold true for all integers?

Yes, this statement holds true for all integers. We can prove this by considering the two cases where n is an even or odd integer. For even integers, n can be represented as the sum of two equal integers, making it a sum of squares. For odd integers, n can be represented as the sum of two consecutive integers, making it a sum of squares. Therefore, this statement holds true for all integers.

Is there a real-world application for this statement?

Yes, this statement has applications in various fields such as geometry, number theory, and physics. In geometry, it is used to prove the sum of squares theorem. In number theory, it is used to find solutions to Diophantine equations. In physics, it is used to calculate the energy of a vibrating string or a particle in a potential well. Understanding this statement can also help in problem-solving and critical thinking skills.

Back
Top