Putnam 1996 B5
- Session B
Given a finite string of symbols and , we write for the number of 's in minus the number of 's. For example, . We call a string balanced if every substring of (consecutive symbols of) has . Thus, is not balanced, since it contains the substring . Find, with proof, the number of balanced strings of length .
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
Human solution Solution 1 by Manjul Bhargava and Kiran Kedlaya
The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).
Similar problems
These problems have the most words in common with this statement.