Difference between revisions of "2012 UNCO Math Contest II Problems/Problem 3"
m (→See Also) |
(→Solution) |
||
| Line 33: | Line 33: | ||
== Solution == | == Solution == | ||
| − | + | <math>126</math> | |
== See Also == | == See Also == | ||
Latest revision as of 02:24, 13 January 2019
Problem
Mrs. Olson begins a journey at the intersection of Avenue 
and First Street in
the upper left on the attached map. She ends her journey at one of the Starbucks on
Avenue 
. There is a Starbucks on Avenue at every intersection from First Street
through Sixth Street! If Mrs. Olson walks only East and South, how many different
paths to a Starbucks on Avenue can she take? Note that Mrs. Olson may pass one
Starbucks on her way to another Starbucks farther to the East.
![[asy] size(300,100); path R=((0,0)--(0,1)--(2,1)--(2,0)--cycle); for(int rw=0;rw<5;++rw){ for (int cl=0;cl<7;++cl){ filldraw(shift(3*cl,2*rw)*R,green);} } MP("Avenue \: D",(12,1+.5),E); MP("Avenue \: C",(12,3+.5),E); MP("Avenue \: B",(0,5+.5),E); MP("Avenue \: A",(0,7+.5),E); MP(90,"1st\: Street",(3-.5,0),N); MP(90,"2cnd\: Street",(6-.5,0),N); MP(90,"3rd\: Street",(9-.5,0),N); MP(90,"4th\: Street",(12-.5,4),N); MP(90,"5th\: Street",(15-.5,4),N); MP(90,"6th\: Street",(18-.5,4),N); [/asy]](http://latex.artofproblemsolving.com/0/1/b/01bb6c3b0308134e000fef05ec2fe00371024e04.png)
Solution
See Also
| 2012 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 2 |
Followed by Problem 4 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
| All UNCO Math Contest Problems and Solutions | ||
