Consider a pyramid whose base is a $2013$-sided polygon. On each face of the pyramid the number $0$ is written. The following operation is carried out: a vertex is chosen from the pyramid and add or subtract $1$ from all the faces that contain that vertex. It's possible, after repeating a finite number of times the previous procedure, that all the faces of the pyramid have the number $1$ written?
Problem
Source: OLCOMA Costa Rica National Olympiad, Final Round, 2013 Shortlist LRP1 day1 (LRP = Logical Reasoning Probability)
Tags: combinatorics