# All tied up

A bowl contains $$N$$ strands of noodles. You reach into the bowl and grab two free ends at random and attach them. You do this $$N$$ times until there are no free ends left.

What is the minimum $$N$$ such that the expected number of loops generated by the $$N$$ steps described above exceeds 3?

×