olymmath

NL-NWO 1995 Problem 5

    An array (a1,a2,...,a13)(a_1,a_2,...,a_{13}) of 1313 integers is called tametame if for each 1≤i≤131 \le i \le 13 the following condition holds: If aia_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 turboturbo tametame 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 1313 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.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator nl-nwo/1995/p5 · Tag 441GWZSQ9E · Edit this page on GitHub · Keys: j next, k previous