MathDB
Dot product divisible by n

Source: IMO ShortList 1991, Problem 13 (POL 4)

August 15, 2008
algebraDivisibilitySequenceIMO Shortlist

Problem Statement

Given any integer n2, n \geq 2, assume that the integers a1,a2,,an a_1, a_2, \ldots, a_n are not divisible by n n and, moreover, that n n does not divide \sum^n_{i\equal{}1} a_i. Prove that there exist at least n n different sequences (e1,e2,,en) (e_1, e_2, \ldots, e_n) consisting of zeros or ones such \sum^n_{i\equal{}1} e_i \cdot a_i is divisible by n. n.