Difference between revisions of "1991 AIME Problems/Problem 10"
Qwertysri987 (talk | contribs) (→Solution 3) |
Sblnuclear17 (talk | contribs) m (→Problem) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | Two three-letter strings, <math>aaa^{}_{}</math> and <math>bbb^{}_{}</math>, are transmitted electronically. Each string is sent letter by letter. Due to faulty equipment, each of the six letters has a 1/3 chance of being received incorrectly, as an <math>a^{}_{}</math> when it should have been a <math>b^{}_{}</math>, or as a <math>b^{}_{}</math> when it should be an <math>a^{}_{}</math>. However, whether a given letter is received correctly or incorrectly is | + | Two three-letter strings, <math>aaa^{}_{}</math> and <math>bbb^{}_{}</math>, are transmitted electronically. Each string is sent letter by letter. Due to faulty equipment, each of the six letters has a 1/3 chance of being received incorrectly, as an <math>a^{}_{}</math> when it should have been a <math>b^{}_{}</math>, or as a <math>b^{}_{}</math> when it should be an <math>a^{}_{}</math>. However, whether a given letter is received correctly or incorrectly is independent of the reception of any other letter. Let <math>S_a^{}</math> be the three-letter string received when <math>aaa^{}_{}</math> is transmitted and let <math>S_b^{}</math> be the three-letter string received when <math>bbb^{}_{}</math> is transmitted. Let <math>p</math> be the [[probability]] that <math>S_a^{}</math> comes before <math>S_b^{}</math> in alphabetical order. When <math>p</math> is written as a [[fraction]] in [[irreducible fraction|lowest terms]], what is its [[numerator]]? |
__TOC__ | __TOC__ | ||
+ | |||
== Solution == | == Solution == | ||
=== Solution 1 === | === Solution 1 === |
Revision as of 05:09, 25 February 2024
Problem
Two three-letter strings, and , are transmitted electronically. Each string is sent letter by letter. Due to faulty equipment, each of the six letters has a 1/3 chance of being received incorrectly, as an when it should have been a , or as a when it should be an . However, whether a given letter is received correctly or incorrectly is independent of the reception of any other letter. Let be the three-letter string received when is transmitted and let be the three-letter string received when is transmitted. Let be the probability that comes before in alphabetical order. When is written as a fraction in lowest terms, what is its numerator?
Contents
[hide]Solution
Solution 1
Let us make a chart of values in alphabetical order, where are the probabilities that each string comes from and multiplied by , and denotes the partial sums of (in other words, ):
The probability is , so the answer turns out to be , and the solution is .
Solution 2
Let be the th letter of string . Compare the first letter of the string to the first letter of the string . There is a chance that comes before . There is a that is the same as .
If , then you do the same for the second letters of the strings. But you have to multiply the chance that comes before as there is a chance we will get to this step.
Similarly, if , then there is a chance that we will get to comparing the third letters and that comes before .
So we have . Therefore, the answer is .
Solution 3
Consider letter strings instead. If the first letters all get transmitted correctly, then the string will be first. Otherwise, the only way is for both of the first letters to be the same, and then we consider the next letter string following the first letter. This easily leads to a recursion: . Clearly, . Therefore, the answer is .
Solution 4 (a more explicit Solution 3)
The probability that will take the form _ _ and that will take the form _ _ is . Then, the probability that both and will share the same first digit is . Now if the first digits of either sequence are the same, then we must now consider these same probabilities for the second letter of each sequence. The probability that when the first two letters of both sequences are the same, that the second letter of is and that the second letter of is is . Similarly, the probability that when the first two letters of both sequences are the same, that the second set of letters in both sets of sequences are the same is . Now, if the last case is true then the probability that precedes is . Therefore the total probability would be: . Therefore the answer is .
~qwertysri987
See also
1991 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.