MathDB
Split Into Groups With Different Remainders of Sums

Source: Ukrainian Mathematical Olympiad 2023. Day 2, Problem 8.8

April 5, 2023
number theory

Problem Statement

You are given a set of mm integers, all of which give distinct remainders modulo some integer nn. Show that for any integer kmk \le m you can split this set into kk nonempty groups so that the sums of elements in these groups are distinct modulo nn.
Proposed by Anton Trygub