2012 AMC 10B Problems/Problem 25
Revision as of 21:43, 23 February 2012 by VjiaoBlack (talk | contribs)
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?
Post the following into equal-width font:
->-
/ \
->- ->-
/ \ / \
->- ->- ->-
/ \ / \ / \
->- ->- ->- ->-
/ \ / \ / \ / \
A -<- -<- -<- B
\ / \ / \ / \ /
->- ->- ->- ->-
\ / \ / \ /
->- ->- ->-
\ / \ /
->- ->-
\ /
->-
->-
/ \
->- ->-
/ \ / \
->- ->- ->-
/ \ / \ / \
->- ->- ->- ->-
/ \ / \ / \ / \
A -<- -<- -<- B
\ / \ / \ / \ /
->- ->- ->- ->-
\ / \ / \ /
->- ->- ->-
\ / \ /
->- ->-
\ /
->-
