Päevaülesanne

Juhuslik

Harjutuskomplekt

Balti Tee 1997 · Ülesanne 9

Arvuteooria

The worlds in the Worlds' Sphere are numbered 1,2,3,…1,2,3, \ldots and connected so that for any integer n⩾1n \geqslant 1, Gandalf the Wizard can move in both directions between any worlds with numbers n,2nn, 2 n and 3n+13 n+1. Starting his travel from an arbitrary world, can Gandalf reach every other world?

Muuda valikut

Kui oled valmis

Ülevaatematerjal muutub kättesaadavaks järgmise päevaülesannete komplektiga.

Ülevaade

Teemad

Diofantilised võrrandid

Lahendused

Lahendus

Solution: Answer: yes. For any two given worlds, Gandalf can move between them either in both directions or none. Hence, it suffices to show that Gandalf can move to the world 11 from any given world nn. For that, it is sufficient for him to be able to move from any world n>1n>1 to some world mm such that m<nm<n. We consider three possible cases:

a) If n=3k+1n=3k+1, then Gandalf can move directly from the world nn to the world k<nk<n.

b) If n=3k+2n=3k+2, then Gandalf can move from the world nn to the world 2n=6k+4=3⋅(2k+1)+12n=6k+4=3\cdot(2k+1)+1 and further to the world 2k+1<n2k+1<n.

c) If n=3kn=3k then Gandalf can move from the world nn to the world 3n+1=9k+13n+1=9k+1, further from there to the worlds 2⋅(9k+1)=18k+22\cdot(9k+1)=18k+2, 2⋅(18k+2)=36k+4=3⋅(12k+1)+12\cdot(18k+2)=36k+4=3\cdot(12k+1)+1, 12k+112k+1, 4k4k and finally to the world 2k<n2k<n.

Võistluse kontekst

Balti Tee tulemused 1997

11 võistkonda

Keskmine tulemus
1,7 / 5
4 või 5 punkti
2 / 11
Eesti
3 / 5

Punktijaotus

05
11
21
32
40
52
Kõigi võistkondade punktid
VõistkondPunktid
Poland1 / 5
Germany5 / 5
Estonia3 / 5
Sweden0 / 5
Denmark0 / 5
Latvia0 / 5
Finland3 / 5
Norway5 / 5
St. Petersburg0 / 5
Iceland0 / 5
Lithuania2 / 5