We have a closed path on a vertices of a n×n 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 . functiongeometrypigeonhole principlecombinatorics proposedcombinatorics