by Rijul saini, Jun 4, 2025, 6:59 PM
Having won the elections in Linetown, Turbo the Snail has become mayor, and one of the most pressing issues he needs to work on is the road network. Linetown can be represented as a configuration of

lines
in the plane, of which no two are parallel and no three are concurrent.
There is one house in Linetown for each pairwise intersection of two lines. The

lines are used as roads by the townsfolk. In the past, the roads in Linetown used to be two-way, but this often led to residents accidentally cycling back to where they started.
Turbo wants to make each of the

roads one-way such that it is impossible for any resident to start at a house, follow the roads in the correct directions, and end up back at the original house. In how many ways can Turbo achieve this?
Proposed by Archit Manas
This post has been edited 1 time. Last edited by Rijul saini, Yesterday at 7:27 PM