Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2006 Alabama ARML TST Problems/Problem 15"

(New page: ==Problem== Ying lives on Strangeland, a tiny planet with 4 little cities that are each 100 miles apart from each other. One day, Ying begins driving from her home city of Viavesta to the ...)
 
(→‎See also)
Line 10: Line 10:
  
 
==See also==
 
==See also==
 +
{{ARML box|year=2006|state=Alabama|num-b=14|after=Final Question}}

Revision as of 11:34, 12 August 2008

Problem

Ying lives on Strangeland, a tiny planet with 4 little cities that are each 100 miles apart from each other. One day, Ying begins driving from her home city of Viavesta to the city of Havennew, which takes her about an hour. When she gets to Havennew, she decides she wants to go straight to another city on Strangeland, so she randomly chooses one of the other three cities (possibly Viavesta), and starts driving there. Ying drives like this for most of the day, making 8 total trips between cities on Strangeland, choosing randomly where to drive to next from each stop. She then stops at her final city of destination, digs a hole, and buries her car.

Let $p$ be the probability Ying buried her car in Viavesta and let q be the probability she buried it in Havennew. Find the value of $p + q$.

Solution

Since the probability that Ying buries her car in a city that is not Havennew is equal for each city, we just need to find the probability that she buries it in Havennew, and we can find the probability of it being buried in Viavesta.

She begins in Havennew, and she makes 7 trips. Let's define going to somewhere other than Havennew $a$, and driving to Havennew $b$. We can arrange $a$'s and $b$'s and find the probability of each arrangement happening. No two $b$'s can be consecutive, an $a$ must be first, and a $b$ must be last. So we have $a----ab$. We can fill in those dashes with $aaaa$, $aaab$, $aaba$, $abaa$, $baaa$, $baba$, $baab$, and $abab$. The probability of $aaaaaab$ happening is $\frac{32}{729}$, the probability of $aaaabab$, $aaabaab$, $aabaaab$, or $abaaaab$ happening is $\frac{8}{243}$, and the probability of $ababaab$, $abaabab$, or $aababab$ happening is $\frac{2}{81}$. Thus $q=\frac{182}{729}$. Thus the probability that she buried it in a city other than Havennew is $\frac{547}{729}$, and the probability she buried it in Viavesta is $\frac{547}{2187}$. $p+q=\frac{547+546}{2187}=\frac{1093}{2187}$.

See also

2006 Alabama ARML TST (Problems)
Preceded by:
Problem 14 		Followed by:
Final Question
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2006_Alabama_ARML_TST_Problems/Problem_15&oldid=27391"