benchmarks.wiki / Public workspace

Omni-MATH / All the sequences consisting of five letters from the set {T,U,R,N,I,P} (with repetitions allowed) are arranged in alphabetical order in a dictionary. Two sequences are called "ana…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

All the sequences consisting of five letters from the set {T,U,R,N,I,P}\{T, U, R, N, I, P\} (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?
Plain-text mathematical notation (without MathML)
All the sequences consisting of five letters from the set {T,U,R,N,I,P} (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?
Original LaTeX notation
All the sequences consisting of five letters from the set $\{T, U, R, N, I, P\}$ (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?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import