MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
Harvard-MIT Mathematics Tournament
2009 Harvard-MIT Mathematics Tournament
3
2009 Combinatorics #3 - Rearrangements with Restrictions
2009 Combinatorics #3 - Rearrangements with Restrictions
Source:
January 7, 2012
HMMT
Problem Statement
How many rearrangements of the letters of "
H
M
M
T
H
M
M
T
HMMTHMMT
H
MMT
H
MMT
" do not contain the substring "
H
M
M
T
HMMT
H
MMT
"? (For instance, one such arrangement is
H
M
M
H
M
T
M
T
HMMHMTMT
H
MM
H
MTMT
.)
Back to Problems
View on AoPS