Problem 7 - A Gentle Introduction to the Art of Mathematics

Question

Lagrange's theorem on representation of integers as sums of squares says that every positive integer can be expressed as the sum of at most 4 squares. For example, \(79=7^{2}+5^{2}+2^{2}+1^{2} .\) Show (exhaustively) that 15 can not be represented using fewer than 4 squares.

Step-by-Step Solution

Answer

15 can only be represented as the sum of 4 squares; fewer than 4 squares are insufficient.

Step 1 - Identify Possible Squares

List all square numbers less than or equal to the integer 15: 0, 1, 4, 9.

Step 2 - Check if 15 is a Perfect Square

Check if 15 is a perfect square: Sqrt(15) is approximately 3.87, which is not an integer. Thus, 15 is not a perfect square.

Step 3 - Check Representation with Two Squares

Try to express 15 as a sum of two squares: Consider pairs (a, b) such that: a^2 + b^2 = 15 Evaluating pairs: 1. a = 3, b = 2 (3^2 + 2^2 = 9 + 4 = 13) 2. a = 3, b = 3 (3^2 + 3^2 = 9 + 9 = 18) 3. a = 2, b = 0 2^2 + 0^2 = 4 + 0 = 4 None of the pairs sum to 15. Hence, 15 cannot be written as the sum of two squares.

Step 4 - Check Representation with Three Squares

Try to express 15 as a sum of three squares: Consider triplets (a, b, c) such that: a^2 + b^2 + c^2 = 15 Evaluating triplets: 1. a = 3, b = 2, c = 2 3^2 + 2^2 + 2^2 = 9 + 4 + 4 = 172. a = 3, b = 1, c = 1 3^2 + 1^2 + 1^2 = 9 + 1 + 1 = 113. a = 2, b=1, c=22^2 + 1^2 + 2^2 = 4 + 1 + 4 = 94. Other potential combinations are all greater than or less than 15, no valid combination possible to perfectly sum 15 so far.

Step 5 - Check Representation with Four Squares

Finally, try to express 15 as a sum of four squares: Consider quartets (a, b, c, d) such that: a^2 + b^2 + c^2 + d^2 = 15 Evaluating quartets: 1. a = 3, b = 1, c = 1, d = 2 3^2 + 1^2 + 1^2 + 2^2 = 9 + 1 + 1 + 4=15 If need more examples: 2. a=2, b=2, c=1,d=2Other combinations can works also.

Step 6 - Conclusion

Since we have found combinations in Step 5 that only satisfy the criteria for 4 squares, 15 can be expressed as a sum of four squares and fewer than 4 squares results in non-representations.

Key Concepts

What is Lagrange's Theorem on Sums of Squares?

Lagrange's Theorem on Sums of Squares states that every positive integer can be expressed as a sum of four or fewer squares. This means for any positive integer, it is possible to find non-negative integers (which may include zero) such that their squares add up to the given integer. For instance, 15 can be expressed as 1² + 2² + 1² + 3².

However, not all numbers have the same minimum number of square representations. The step-by-step example involving the number 15 demonstrates how to check for sums of squares using fewer than four squares and why it's necessary to use all four squares for representing 15.

Integer Representation

In mathematics, integer representation refers to the ways in which integers can be expressed using other numbers. For example, in the context of Lagrange’s theorem, representing an integer as the sum of squares is a form of integer representation. The integers we use (1, 2, 3, etc.) can all be broken down into square numbers, which are used to build up the original integer.

For instance, consider the integer 15. According to the steps provided:

• We start by identifying the possible squares: 0, 1, 4, 9.
• Then, we attempted to sum these squares to get 15 with two and then three squares combinations.
• None of these combinations worked, necessitating the use of four squares, such as 1² + 2² + 1² + 3² = 15.

Combinatorial Mathematics in Sums of Squares

Combinatorial mathematics deals with counting, arrangement, and combination strategies which help us solve problems involving finite structures. When applying Lagrange's theorem, combinatorial mathematics comes into play in trying different square number combinations to achieve an integer.

In the exercise involving 15:

• We identified squares less than or equal to 15.
• We then tried pair combinations (a, b) to see if their squares added to 15.
• We escalated to triplet combinations (a, b, c).
• Finally, we evaluated quartet combinations (a, b, c, d).

This method of trying combinations methodically, from simplest to most complex, is both systematic and combinatorial. It ensures that all possible combinations are considered, helping conclusively determine the minimum configuration and number of squares required.