Problem

Source: 2011 Sharygin Geometry Olympiad Correspondence Round P18

Tags: geometry, combinatorial geometry, lines, Dissecting plane, Sharygin Geometry Olympiad



On the plane, given are $n$ lines in general position, i.e. any two of them aren’t parallel and any three of them don’t concur. These lines divide the plane into several parts. What is a) the minimal, b) the maximal number of these parts that can be angles?