olymmath

AT-OEMO-FED1 2009 Problem 3

    There are nn bus stops placed around the circular lake. Each bus stop is connected by a road to the two adjacent stops (we call a segment the entire road between two stops). Determine the number of bus routes that start and end in the fixed bus stop A, pass through each bus stop at least once and travel through exactly n+1n+1 segments.

    Dataset text AoPS wiki problems. 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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator at-oemo-fed1/2009/p3 · Tag G2HBFZQ7A8 · Edit this page on GitHub · Keys: j next, k previous