Problem

Source: Indonesia TST 2009 First Stage Test 5 Problem 3

Tags: group theory, abstract algebra, modular arithmetic, combinatorics proposed, combinatorics



Let $ S=\{1,2,\ldots,n\}$. Let $ A$ be a subset of $ S$ such that for $ x,y\in A$, we have $ x+y\in A$ or $ x+y-n\in A$. Show that the number of elements of $ A$ divides $ n$.