Olympiad Maths Prep

Track / Stage 7 / 246 of 300 #1646 of 2000

Problem 1646

National olympiad second round; IMO P1/P4
Number theory Difficulty 7.6 Prove it

A positive integer nn is called omopeiroomopeiro if there exists nn non-zero integers that are not necessarily distinct such that 20212021 is the sum of the squares of those nn integers. For example, the number 22 is not an omopeiroomopeiro, because 20212021 is not a sum of two non-zero squares, but 20212021 is an omopeiroomopeiro, because 2021=12+12++122021=1^2+1^2+ \dots +1^2, which is a sum of 20212021 squares of the number 11.

Prove that there exist more than 1500 omopeiroomopeiro numbers.

Note: proving that there exist at least 500 omopeiroomopeiro numbers is worth 2 points.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

1. Initial Observation:
We start by noting that 20212021 can be expressed as the sum of 20212021 squares of 11:
2021=12+12++12(2021 terms) 2021 = 1^2 + 1^2 + \cdots + 1^2 \quad (\text{2021 terms})
This means 20212021 is an omopeiro number.

2. Reduction Process:
We can reduce the number of terms by substituting four 121^2 terms with a single 222^2 term:
412=22 4 \cdot 1^2 = 2^2
This substitution reduces the number of terms by 3 each time we perform it.

3. Constructing New Omopeiro Numbers:
- Start with 20212021:
2021=12+12++12(2021 terms) 2021 = 1^2 + 1^2 + \cdots + 1^2 \quad (\text{2021 terms})
- Substitute four 121^2 terms with one 222^2:
2021=22+22++22+12+12+12(505 terms of 22 and 1 term of 12) 2021 = 2^2 + 2^2 + \cdots + 2^2 + 1^2 + 1^2 + 1^2 \quad (\text{505 terms of } 2^2 \text{ and 1 term of } 1^2)
This gives us 20213×505=20211515=5062021 - 3 \times 505 = 2021 - 1515 = 506 terms.

4. Further Reduction:
- Continue the process:
506=22+22++22+12(126 terms of 22 and 2 terms of 12) 506 = 2^2 + 2^2 + \cdots + 2^2 + 1^2 \quad (\text{126 terms of } 2^2 \text{ and 2 terms of } 1^2)
This gives us 5063×126=506378=128506 - 3 \times 126 = 506 - 378 = 128 terms.
- Continue:
128=22+22++22(32 terms of 22) 128 = 2^2 + 2^2 + \cdots + 2^2 \quad (\text{32 terms of } 2^2)
This gives us 1283×32=12896=32128 - 3 \times 32 = 128 - 96 = 32 terms.
- Continue:
32=22+22++22(8 terms of 22) 32 = 2^2 + 2^2 + \cdots + 2^2 \quad (\text{8 terms of } 2^2)
This gives us 323×8=3224=832 - 3 \times 8 = 32 - 24 = 8 terms.
- Continue:
8=22+22(2 terms of 22) 8 = 2^2 + 2^2 \quad (\text{2 terms of } 2^2)
This gives us 83×2=86=28 - 3 \times 2 = 8 - 6 = 2 terms.

5. Conclusion:
By repeatedly applying the reduction process, we can generate a sequence of omopeiro numbers. Each step reduces the number of terms by 3, and we can continue this process until we reach a number of terms that is less than or equal to 2.

Since we started with 20212021 and reduced by 3 each time, we can perform this reduction process 20213=673\left\lfloor \frac{2021}{3} \right\rfloor = 673 times. This means we can generate at least 20213×673=20212019=22021 - 3 \times 673 = 2021 - 2019 = 2 terms.

Therefore, there are at least 20212=20192021 - 2 = 2019 omopeiro numbers.

The final answer is 2019 \boxed{ 2019 } omopeiro numbers.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.