Difference between revisions of "1986 AIME Problems/Problem 13"

m (box)
m
Line 1: Line 1:
{{empty}}
 
 
== Problem ==
 
== 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 ==
 
== Solution ==
 
{{solution}}
 
{{solution}}

Revision as of 21:27, 10 February 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 (ProblemsAnswer KeyResources)
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