Difference between revisions of "2002 AIME I Problems/Problem 1"
I_like_pie (talk | contribs) |
(→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | Many states use a sequence of three letters followed by a sequence of thee digits as their standard license-plate pattern. Given that teach three-letter three-digit arrangement is equally likely, the probability that such a license plate will contain at least one palindromes (a three-letter arrangement or a three-digit arrangement that reads the same left-to-right as it does right-to-left) is <math>\dfrac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math> | ||
== Solution == | == Solution == | ||
Revision as of 15:03, 25 September 2007
Problem
Many states use a sequence of three letters followed by a sequence of thee digits as their standard license-plate pattern. Given that teach three-letter three-digit arrangement is equally likely, the probability that such a license plate will contain at least one palindromes (a three-letter arrangement or a three-digit arrangement that reads the same left-to-right as it does right-to-left) is 
, where 
and 
are relatively prime positive integers. Find 
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
