Balti Tee 1997 · Ülesanne 19
Kombinatoorika
In a forest each of animals lives in its own cave, and there is exactly one separate path between any two of these caves. Before the election for King of the Forest some of the animals make an election campaign. Each campaign-making animal visits each of the other caves exactly once, uses only the paths for moving from cave to cave, never turns from one path to another between the caves and returns to its own cave in the end of its campaign. It is also known that no path between two caves is used by more than one campaign-making animal.
a) Prove that for any prime , the maximum possible number of campaign-making animals is ;
b) Find the maximum number of campaign-making animals for .
Kui oled valmis
Ülevaatematerjal muutub kättesaadavaks järgmise päevaülesannete komplektiga.
Ülevaade
Teemad
Graafiteooria
Lahendused
Lahendus
Solution:
a) As each campaign-making animal uses exactly paths and the total number of paths is , the number of campaign-making animals cannot exceed . Labeling the caves by integers , we can construct non-intersecting campaign routes as follows:
(As each of these cyclic routes passes through any cave, the campaign-making animals can be chosen arbitrarily).
b) As noted above, the number of campaign-making animals cannot exceed . The 4 non-intersecting campaign routes can be constructed as follows:
Võistluse kontekst
Balti Tee tulemused 1997
11 võistkonda
- Keskmine tulemus
- 3,0 / 5
- 4 või 5 punkti
- 2 / 11
- Eesti
- 3 / 5
Punktijaotus
Kõigi võistkondade punktid
| Võistkond | Punktid |
|---|---|
| Poland | 3 / 5 |
| Germany | 3 / 5 |
| Estonia | 3 / 5 |
| Sweden | 3 / 5 |
| Denmark | 3 / 5 |
| Latvia | 1 / 5 |
| Finland | 2 / 5 |
| Norway | 3 / 5 |
| St. Petersburg | 2 / 5 |
| Iceland | 5 / 5 |
| Lithuania | 5 / 5 |