Maths Olympiad Prep

Library / /48 of 520

Number theory Difficulty 6.3 National olympiad Find the answer

How many of the numbers 1231\cdot 2\cdot 3, 2342\cdot 3\cdot 4,..., 2020202120222020 \cdot 2021 \cdot 2022 are divisible by 20202020?

Solution

To determine how many of the numbers 1231 \cdot 2 \cdot 3, 2342 \cdot 3 \cdot 4, ..., 2020202120222020 \cdot 2021 \cdot 2022 are divisible by 20202020, we need to analyze the divisibility conditions.

1. Factorize 2020:
2020=225101 2020 = 2^2 \cdot 5 \cdot 101
Therefore, a number n(n+1)(n+2)n(n+1)(n+2) must be divisible by 222^2, 55, and 101101.

2. **Divisibility by 222^2**:
- Among any three consecutive integers, at least one is divisible by 44 (since every fourth number is divisible by 44).
- Therefore, n(n+1)(n+2)n(n+1)(n+2) is always divisible by 44.

3. **Divisibility by 55**:
- Among any three consecutive integers, at least one is divisible by 55 (since every fifth number is divisible by 55).
- Therefore, n(n+1)(n+2)n(n+1)(n+2) is always divisible by 55.

4. **Divisibility by 101101**:
- We need to check how many of the numbers 1,2,3,,20201, 2, 3, \ldots, 2020 are divisible by 101101.
- The multiples of 101101 in this range are 101,202,303,,2020101, 202, 303, \ldots, 2020. There are 2020 such multiples.

5. Counting the valid triplets:
- For each multiple of 101101, we need to check how many triplets n(n+1)(n+2)n(n+1)(n+2) include this multiple.
- We create a table to count the number of triplets for each multiple of 101101:

Multiple of 101Number of triplets1012202130314042505260617070808190911010211111121211313014141151521616217171181811919220203 \begin{array}{|c|c|} \hline \text{Multiple of 101} & \text{Number of triplets} \\ \hline 101 & 2 \\ 202 & 1 \\ 303 & 1 \\ 404 & 2 \\ 505 & 2 \\ 606 & 1 \\ 707 & 0 \\ 808 & 1 \\ 909 & 1 \\ 1010 & 2 \\ 1111 & 1 \\ 1212 & 1 \\ 1313 & 0 \\ 1414 & 1 \\ 1515 & 2 \\ 1616 & 2 \\ 1717 & 1 \\ 1818 & 1 \\ 1919 & 2 \\ 2020 & 3 \\ \hline \end{array}

6. Summing the counts:
- Summing the numbers in the second column of the table:
2+1+1+2+2+1+0+1+1+2+1+1+0+1+2+2+1+1+2+3=27 2 + 1 + 1 + 2 + 2 + 1 + 0 + 1 + 1 + 2 + 1 + 1 + 0 + 1 + 2 + 2 + 1 + 1 + 2 + 3 = 27

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

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