Difference between revisions of "2010 AMC 12A Problems/Problem 18"
(→Solution: boxed answer) |
CalcCrunch (talk | contribs) (→Solution) |
||
| Line 12: | Line 12: | ||
Again, there are <math>1</math> paths of the first kind, <math>{8\choose 1}^2=64</math> paths of the second kind, and <math>{8\choose 2}^2=28^2=784</math> paths of the third type. | Again, there are <math>1</math> paths of the first kind, <math>{8\choose 1}^2=64</math> paths of the second kind, and <math>{8\choose 2}^2=28^2=784</math> paths of the third type. | ||
| − | Hence the total number of paths is <math>2(1+ | + | Hence the total number of paths is <math>2(1+64+784) = \boxed{1698}</math>. |
== See also == | == See also == | ||
Revision as of 19:01, 10 January 2015
Problem
A 16-step path is to go from 
to 
with each step increasing either the 
-coordinate or the 
-coordinate by 1. How many such paths stay outside or on the boundary of the square 
, 
at each step?
Solution
Each path must go through either the second or the fourth quadrant.
Each path that goes through the second quadrant must pass through exactly one of the points 
, 
, and 
.
There are 
paths of the first kind, 
paths of the second kind, and 
paths of the third type.
Each path that goes through the fourth quadrant must pass through exactly one of the points 
, 
, and 
.
Again, there are paths of the first kind, paths of the second kind, and paths of the third type.
Hence the total number of paths is 
.
See also
| 2010 AMC 12A (Problems • Answer Key • Resources) | |
| Preceded by Problem 17 |
Followed by Problem 19 |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
| All AMC 12 Problems and Solutions | |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
