This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

2013 Junior Balkan Team Selection Tests - Romania, 4
Tags: number theory , tsts
Find all integers $n \ge 2$ with the property: there is a permutation $(a_1,a2,..., a_n)$ of the set $\{1, 2,...,n\}$ so that the numbers $a_1 + a_2 +...+ a_k, k = 1, 2,...,n$ have diffferent remainders when divided by $n$