IMO Shortlist 1987 problem 14


Kvaliteta:
  Avg: 0,0
Težina:
  Avg: 0,0
Dodao/la: arhiva
2. travnja 2012.
LaTeX PDF
How many words with n digits can be formed from the alphabet \{0, 1, 2, 3, 4\}, if neighboring digits must differ by exactly one?

Proposed by Germany, FR.
Izvor: Međunarodna matematička olimpijada, shortlist 1987