# Number Theory Problem

Determine all positive integers $n \geq 2$ such that, given any integers $a_1, a_2, ... , a_n$ , it is possible to find integers i and j ( $1 \leq i < j \leq n$ ) such that:
$a_i + a_{i+1}$ and $a_j + a_{j+1}$ leave the same remainder in the division by $n$
Note: Consider $a_{n+1} = a_1$.

Sorry, I can't really write in $\LaTeX$. Note by John Smith
4 years, 7 months ago

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

• Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
• Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
• Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$ ... $$ or $ ... $ to ensure proper formatting.
2 \times 3 $2 \times 3$
2^{34} $2^{34}$
a_{i-1} $a_{i-1}$
\frac{2}{3} $\frac{2}{3}$
\sqrt{2} $\sqrt{2}$
\sum_{i=1}^3 $\sum_{i=1}^3$
\sin \theta $\sin \theta$
\boxed{123} $\boxed{123}$

Sort by:

Re Latex, you've got the code. You just needed to add in the Latex brackets of $\backslash ( \quad \backslash)$. I've edited your note so you can see my edits.

Staff - 4 years, 7 months ago

@Calvin Lin Thank you very much! And do you have any idea of how I can proceed in this problem? I haven't made any progress.

- 4 years, 7 months ago

What have you tried? Where are you stuck?

What type of problem does this resemble? What approaches do you think should be pursued?

Staff - 4 years, 7 months ago

- 4 years, 7 months ago

I could do it if the integers didn't have to be onsecutive in the set of integers given, because there are n numbers with n possible remainders for them, so it would be easy. But like this, I really don't know how to start.

- 4 years, 7 months ago

That's a good start. You realized that if we set $b_i = a_i + a_{i+1}$, we would get $n$ numbers with $n$ possible remainders.

1. Suppose that all of the remainders are different. What conclusion can we draw?
2. What is a necessary condition for the remainders to not be different? Let's try small cases.
3. What is a necessary condition for the remainders to be different?
4. For each value that satisfies the necessary condition, can we create a sequence that gives us those remainder? Let's use really wishful thinking even.
5. Does this help us classify all positive integers?

Staff - 4 years, 7 months ago

@Calvin Lin I think that if all sums had different remainders, the remainders of the numbers in odd positions of the set given would all be different and the ones in even positions would all be different.

- 4 years, 7 months ago

That's a thought. Continue developing it. Try small cases. Play around.

For $n = 2, 3, 4 , \ldots$, we have at most $n^2$ sets of remainders to test, so you should be able to make some initial guesses pretty quickly.

Staff - 4 years, 7 months ago

@Calvin Lin I couldn't do it. I did what you said and tried a lot for $n=2 , 3, 4 ...$ but I couldn't make any progress. I should start with easier problems maybe. Have you solved this? How?

- 4 years, 7 months ago

I've not worked it out completely, but I believe the way I outlined below leads to a solution. I do believe that looking at small cases will help you get towards the approach, especially if you think of generalizing (instead of proving specific cases)

What conclusions did you get for small values? Is there a pattern?

This problem seems typical of pigeonhole principle, which is what you were suggesting when you said "n numbers, n possible remainders". We want to get some kind of conclusion / conclusion when all the remainders are distinct. For example, one thing that pops into mind, is the sum of all these remainders.

Staff - 4 years, 7 months ago