Problem

Source: JBTST I, Romania, 2007

Tags: geometry, combinatorics proposed, combinatorics



A rectangularly paper is divided in polygons areas in the following way: at every step one of the existing surfaces is cut by a straight line, obtaining two new areas. Which is the minimum number of cuts needed such that between the obtained polygons there exists $251$ polygons with $11$ sides?