2012 AMC 10B Problems/Problem 25
Revision as of 15:47, 23 August 2012 by Math Kirby (talk | contribs)
- The following problem is from both the 2012 AMC 12B #22 and 2012 AMC 10B #25, so both problems redirect to this page.
A bug travels from A to B along the segments in the hexagonal lattice pictured below. The segments marked with an arrow can be traveled only in the direction of the arrow, and the bug never travels the same segment more than once. How many different paths are there?