olymmath

VTRMC 2006 Problem 2

    Let S(n)S(n) denote the number of sequences of length nn formed by the three letters A,B,CA,B,C with the restriction that the CC 's (if any) all occur in a single block immediately following the first BB (if any). For example ABCCAAABCCAA , AAABAAAAABAA , and ABCCCCABCCCC are counted in, but ACACCBACACCB and CAAAAACAAAAA are not. Derive a simple formula for S(n)S(n) and use it to calculate S(10)S(10) .

    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.

    Add a solution

    Similar problems

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

    Locator vtrmc/2006/p2 · Tag Y5WG8YF1CG · Edit this page on GitHub · Keys: j next, k previous