Let k be a positive integer and P a point in the plane. We wish to draw lines, none passing through P, in such a way that any ray starting from P intersects at least k of these lines. Determine the smallest number of lines needed. combinatoricsgeometrycombinatorial geometry