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

1994 India National Olympiad, 3

Tags: old , combinatorics
In any set of $181$ square integers, prove that one can always find a subset of $19$ numbers, sum of whose elements is divisible by $19$.