8

Part of 1981 Austrian-Polish Competition

Problems(1)

partition plane to N regions by three bunches of parallel lines

Source: Austrian Polish 1981 APMC

The plane has been partitioned into

N

regions by three bunches of parallel lines. What is the least number of lines needed in order that

N > 1981

combinatorial geometrycombinatoricsPlanelinesparallel