MathDB
Counting Regions

Source: 2013 Greek TST,Pr.4

May 24, 2016
combinatoricscountingcircleslines

Problem Statement

Given are nn different concentric circles on the plane.Inside the disk with the smallest radius (strictly inside it),we consider two distinct points A,BA,B.We consider kk distinct lines passing through AA and mm distinct lines passing through BB.There is no line passing through both AA and BB and all the lines passing through kk intersect with all the lines passing through BB.The intersections do not lie on some of the circles.Determine the maximum and the minimum number of regions formed by the lines and the circles and are inside the circles.