Putnam 2025 A5
- Session A
Let be an integer with . For a sequence where each , let be the number of permutations of such that for all . For each , determine the sequences for which is maximal.
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng
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.