Olympiad Maths Prep

Library / /2 of 11

Combinatorics Difficulty 5.1 AIME, harder Prove it Czech Republic

The number 00 is written on each of the n+1n+1 faces of an nn-sided pyramid. In a step we choose a vertex and we increase by 11 each number on the faces, which contain the vertex. Show, that in such way, we cannot get number 11 written on each face.

(Peter Novotný)

Solution

Let bb be the sum of numbers on side faces of the pyramid, let aa be the number on the base. After a step involving any base vertex, bb increases or decreases by 22 and aa increases or decreases by 11, that means the value V=b2aV = b - 2a stays the same. If we choose for a step the apex, only bb increases or decreases by nn, thus VV increases or decreases by nn as well. Therefore VV is in the process always divisible by nn. But in the position with number 11 written on each side, the corresponding VV is n2n-2, which is not divisible by nn (as n>2n > 2).

Looking for a route rather than an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.