Question 114
Find all integers $n \geq 3$ for which it is possible to draw $n$ chords of one circle such that their $2 n$ endpoints are pairwise distinct and each chord intersects precisely $k$ other chords for:
(a) $k=n-2$,
(b) $k=n-3$.
(a) $k=n-2$,
(b) $k=n-3$.