![]() |
[home] [lexicon] [problems] [tests] [courses] [auxiliaries] [notes] [staff] |
![]() |
Mathematics-Online problems: | ||
Solution to the problem of the (previous) week |
Problem:
The figure shows the concept of a grid plan for a city, where mathematics is to play an important part.
Determine the number of possibilities to reach each of the intersections
marked ,
,
, and
, respectively, when setting off
at the intersection
Galois Avenue/Gauss Street
and choosing the shortest possible
route. (Routes with the same number of intersections are
considered to be of equal length.) Take into account that the 2 shaded
intersections of Cea Place are closed.
Answer:
From K to A there exist | possibilities. |
From K to B there exist | possibilities. |
From K to C there exist | possibilities. |
From K to D there exist | possibilities. |
Solution:
|
|
|||||
|
Markov Ave/Riemann St |
|
Markov Ave/Euler St |
|
||
|
Dirac Ave/Riemann St |
|
Dirac Ave/Euler St |
|