Difference between revisions of "2019 AMC 12B Problems/Problem 10"

(Problem)
Line 1: Line 1:
 
==Problem==
 
==Problem==
 +
The figure below is a map showing <math>12</math> cities and <math>17</math> roads connecting certain pairs of cities. Paula wishes to travel along exactly <math>13</math> of those roads, starting at city <math>A</math> and ending at city <math>L</math>, without traveling along any portion of a road more than once. (Paula is allowed to visit a city more than once.)
 +
 +
!! Someone with good Latex or Asymptote skills please help !!
 +
 +
How many different routes can Paula take?
  
 
==Solution==
 
==Solution==

Revision as of 16:31, 14 February 2019

Problem

The figure below is a map showing $12$ cities and $17$ roads connecting certain pairs of cities. Paula wishes to travel along exactly $13$ of those roads, starting at city $A$ and ending at city $L$, without traveling along any portion of a road more than once. (Paula is allowed to visit a city more than once.)

!! Someone with good Latex or Asymptote skills please help !!

How many different routes can Paula take?

Solution

See Also

2019 AMC 12B (ProblemsAnswer KeyResources)
Preceded by
Problem 9
Followed by
Problem 11
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. AMC logo.png