Päevaülesanne

Juhuslik

Harjutuskomplekt

Balti Tee 1997 · Ülesanne 19

Kombinatoorika

In a forest each of nn animals (n⩾3)(n \geqslant 3) 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 nn, the maximum possible number of campaign-making animals is n−12\frac{n-1}{2};

b) Find the maximum number of campaign-making animals for n=9n=9.

Muuda valikut

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 nn paths and the total number of paths is n(n−1)2\frac{n(n-1)}{2}, the number of campaign-making animals cannot exceed n−12\frac{n-1}{2}. Labeling the caves by integers 0,1,2,…,n−10,1,2, \ldots, n-1, we can construct n−12\frac{n-1}{2} non-intersecting campaign routes as follows:

0→1→2→3→…→n→00→2→4→6→…→n−1→00→3→6→9→…→n−2→0………+⋯0→n−12→n−1→…→n+12→0\begin{aligned} & 0 \rightarrow 1 \rightarrow 2 \rightarrow 3 \rightarrow \ldots \rightarrow n \rightarrow 0 \\ & 0 \rightarrow 2 \rightarrow 4 \rightarrow 6 \rightarrow \ldots \rightarrow n-1 \rightarrow 0 \\ & 0 \rightarrow 3 \rightarrow 6 \rightarrow 9 \rightarrow \ldots \rightarrow n-2 \rightarrow 0 \\ & \ldots \ldots \ldots+\cdots \\ & 0 \rightarrow \frac{n-1}{2} \rightarrow n-1 \rightarrow \ldots \rightarrow \frac{n+1}{2} \rightarrow 0 \end{aligned}

(As each of these cyclic routes passes through any cave, the n−12\frac{n-1}{2} campaign-making animals can be chosen arbitrarily).

b) As noted above, the number of campaign-making animals cannot exceed 9−12=4\frac{9-1}{2}=4. The 4 non-intersecting campaign routes can be constructed as follows:

0→1→2→8→3→7→4→6→5→00→2→3→1→4→8→5→7→6→00→3→4→2→5→1→6→8→7→00→4→5→3→6→2→7→1→8→0\begin{aligned} & 0 \rightarrow 1 \rightarrow 2 \rightarrow 8 \rightarrow 3 \rightarrow 7 \rightarrow 4 \rightarrow 6 \rightarrow 5 \rightarrow 0 \\ & 0 \rightarrow 2 \rightarrow 3 \rightarrow 1 \rightarrow 4 \rightarrow 8 \rightarrow 5 \rightarrow 7 \rightarrow 6 \rightarrow 0 \\ & 0 \rightarrow 3 \rightarrow 4 \rightarrow 2 \rightarrow 5 \rightarrow 1 \rightarrow 6 \rightarrow 8 \rightarrow 7 \rightarrow 0 \\ & 0 \rightarrow 4 \rightarrow 5 \rightarrow 3 \rightarrow 6 \rightarrow 2 \rightarrow 7 \rightarrow 1 \rightarrow 8 \rightarrow 0 \end{aligned}

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

00
11
22
36
40
52
Kõigi võistkondade punktid
VõistkondPunktid
Poland3 / 5
Germany3 / 5
Estonia3 / 5
Sweden3 / 5
Denmark3 / 5
Latvia1 / 5
Finland2 / 5
Norway3 / 5
St. Petersburg2 / 5
Iceland5 / 5
Lithuania5 / 5