Baltic Way 2010 · Problem 18
Number Theory
Let be a prime number. For each , there exists a unique integer denoted by such that and . Prove that the sequence
(addition modulo ) contains at most distinct elements.
When you’re ready
Review material becomes available with the next Daily.
Review
Topics
Modular arithmetic
Solutions
Solution
Calculating modulo we have that so . If is odd, we set and it follows that
For such that we calculate the -th term in the sequence
and see that it is equal to one of the first terms in the sequence. We conclude that there are at most distinct terms in the sequence (the first and the last one).
If is the even prime , then the sequence contains only one term , and .
Contest context
Results from Baltic Way 2010
10 teams
- Mean score
- 4.0 / 5
- Scores of 4 or 5
- 9 / 10
- Estonia
- 0 / 5
Score distribution
01
10
20
30
45
54
All team scores
| Team | Score |
|---|---|
| Poland | 5 / 5 |
| Lithuania | 5 / 5 |
| Germany | 4 / 5 |
| Latvia | 4 / 5 |
| Denmark | 4 / 5 |
| Sweden | 5 / 5 |
| Estonia | 0 / 5 |
| Norway | 4 / 5 |
| Finland | 5 / 5 |
| Iceland | 4 / 5 |