HMMT 2003 U40
- Guts
- Answer
All the sequences consisting of five letters from the set (with repetitions allowed) are arranged in alphabetical order in a dictionary. Two sequences are called "anagrams" of each other if one can be obtained by rearranging the letters of the other. How many pairs of anagrams are there that have exactly 100 other sequences between them in the dictionary?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
0
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.