Difference between revisions of "1986 AIME Problems/Problem 13"
m |
I_like_pie (talk | contribs) (→See also) |
||
| Line 4: | Line 4: | ||
{{solution}} | {{solution}} | ||
== See also == | == See also == | ||
| − | |||
| − | |||
{{AIME box|year=1986|num-b=12|num-a=14}} | {{AIME box|year=1986|num-b=12|num-a=14}} | ||
| + | * [[AIME Problems and Solutions]] | ||
| + | * [[American Invitational Mathematics Examination]] | ||
| + | * [[Mathematics competition resources]] | ||
Revision as of 13:52, 6 May 2007
Problem
In a sequence of coin tosses, one can keep a record of instances in which a tail is immediately followed by a head, a head is immediately followed by a head, and etc. We denote these by TH, HH, and etc. For example, in the sequence HHTTHHHHTHHTTTT of 15 coin tosses we observe that there are two HH, three HT, four TH, and five TT subsequences. How many different sequences of 15 coin tosses will contain exactly two HH, three HT, four TH, and five TT subsequences?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 1986 AIME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 12 |
Followed by Problem 14 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
