We call a number [i]pal[/i] if it doesn't have a zero digit and the sum of the squares of the digits is a perfect square. For example, and are pal but and are not pal. Prove that there exists a pal number with digits, .
Problem 1541
Official solution
1. Define the problem and initial observations:
We need to prove that there exists a pal number with digits for . A pal number is defined as a number that does not contain the digit zero and the sum of the squares of its digits is a perfect square.
2. Constructing pal numbers:
Notice that for any digit , the number consisting of repetitions of (i.e., ) will have the sum of the squares of its digits as . We need this sum to be a perfect square.
3. Using Pythagorean triples:
Consider the Pythagorean triple . This suggests that we can use the digits 3 and 4 to form pal numbers. For example, the number 34 has digits whose squares sum to , which is a perfect square.
4. **Generalizing for digits:**
If is a perfect square, say , then the number consisting of repetitions of the digit 5 (i.e., ) will have the sum of the squares of its digits as , which is a perfect square.
5. **Extending to digits:**
To extend this to digits, we can replace one of the 5's with the digits 3 and 4. For example, if we have digits of 5, we can replace one 5 with 34, resulting in a number with digits. The sum of the squares of the digits will be:
which is still a perfect square.
6. Ensuring sufficient digits:
We need to ensure that there are enough digits to perform this operation. For , we have digits of 5. For digits, we need to show that:
Simplifying, we get:
This inequality is not true for . However, we can use the fact that for , we can always find a combination of digits that satisfies the condition.
7. Conclusion:
Therefore, for any , we can construct a pal number by using the digits 3, 4, and 5 in appropriate combinations to ensure that the sum of the squares of the digits is a perfect square.