MathDB
again a polyhedra problem

Source: Romanian IMO TST 2005 - day 5, problem 4

April 24, 2005
combinatorics proposedcombinatorics

Problem Statement

We consider a polyhedra which has exactly two vertices adjacent with an odd number of edges, and these two vertices are lying on the same edge. Prove that for all integers n3n\geq 3 there exists a face of the polyhedra with a number of sides not divisible by nn.