OIM 2009 Problem 1
Given a positive integer , consider a set of islands arranged in a circle. Between every two neigboring islands two bridges are built as shown in the figure.
Starting at the island , in how many ways one can one can cross the bridges so that no bridge is used more than once?
Attachments:
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.