MathDB
Choosing 6 integers to make 6k

Source: 2003 KJMO

June 29, 2024
combinatoricsmultipleInteger

Problem Statement

When any 1111 integers are given, prove that you can always choose 66 integers among them so that the sum of the chosen numbers is a multiple of 66. The 1111 integers aren't necessarily different.