MathDB
tame array

Source: Netherlands 1995

June 28, 2009
combinatorics unsolvedcombinatorics

Problem Statement

An array (a1,a2,...,a13) (a_1,a_2,...,a_{13}) of 13 13 integers is called tame tame if for each 1i13 1 \le i \le 13 the following condition holds: If ai a_i is left out, the remaining twelve integers can be divided into two groups with the same sum of elements. A tame array is called turbo turbo tame tame if the remaining twelve numbers can always be divided in two groups of six numbers having the same sum. (a) (a) Give an example of a tame array of 13 13 integers (not all equal). (b) (b) Prove that in a tame array all numbers are of the same parity. (c) (c) Prove that in a turbo tame array all numbers are equal.