MEMO 2015 ekipno problem 4


Kvaliteta:
  Avg: 0,0
Težina:
  Avg: 6,0
Dodao/la: arhiva
28. kolovoza 2018.
LaTeX PDF
Let N be a positive integer. In each of the N^2 unit squares of an N \times N board, one of the two diagonals is drawn. The drawn diagonals divide the N \times N board into K regions. For each N, determine the smallest and the largest possible values of K.

{{ Greška pri preuzimanju img datoteke. (Nevaljan broj?) }}
Izvor: Srednjoeuropska matematička olimpijada 2015, ekipno natjecanje, problem 4