Iran TST 2009-Day2-P3
Source:
May 11, 2009
functiongeometrypigeonhole principlecombinatorics proposedcombinatorics
Problem Statement
We have a closed path on a vertices of a × square which pass from each vertice exactly once . prove that we have two adjacent vertices such that if we cut the path from these points then length of each pieces is not less than quarter of total path .