Vrijeme: 23:14

Diamonds & Dancefloors #3

Nakon što ste proučili rasporede plesača, nastavljate obilazak diskokluba. U susjednoj dvorani nailazite na još jedan trokutasti plesni podij, no ovaj se upravo obnavlja. Možete li pomoći pri slaganju njegovih novih pločica?

Za cijeli broj n\geq2 podij ima oblik jednakostraničnog trokuta stranice n, podijeljenog pravilnom trokutastom mrežom na jedinične jednakostranične trokute. Odaberemo jednu visinu podija. Jedinične trokute kroz čiju unutrašnjost prolazi ta visina označimo, redom od vrha prema osnovici, s a_1,a_2,\ldots,a_n.

Na raspolaganju imamo točno po jednu trapeznu pločicu T_2,T_3,\ldots,T_n. Pločica T_k jednakokračni je trapez osnovica duljina k i k-1 te krakova duljine 1; sastoji se od jednog reda od 2k-1 jediničnih trokuta. Na slikama je prikazan podij za n=4 i pripadajuće tri pločice.

Attachment novi.png

Jedno od polja a_1,\ldots,a_n mora ostati nepokriveno jer je ondje predviđeno mjesto za svjetlosni efekt. Ostatak podija treba potpuno prekriti svim raspoloživim pločicama, bez preklapanja i bez izlaska izvan podija. Pločice smijemo zakretati, a svaka mora prekrivati cijela polja trokutaste mreže.

Neka je f(n) ukupan broj takvih popločavanja, pri čemu brojimo i izbor nepokrivenog polja i raspored pločica. Podij je u fiksnom položaju: rasporede dobivene zakretanjem ili zrcaljenjem ne poistovjećujemo, osim ako su zauzeta polja svake pločice ista.

Odredite ostatak pri dijeljenju broja f(2026) brojem 1009.

After examining the dancers' schedules, you continue your tour of the nightclub. In the adjacent hall, you come across another triangular dance floor, but this one is currently being renovated. Can you help arrange its new tiles?

For an integer n \geq 2, the dance floor is shaped like an equilateral triangle with side length n, divided by a regular triangular grid into unit equilateral triangles. We select one altitude of the dance floor. Let a_1, a_2, \ldots, a_n denote the unit triangles through whose interiors this altitude passes, ordered from the vertex to the base.

We have exactly one trapezoidal tile of each type T_2, T_3, \ldots, T_n at our disposal. Tile T_k is an isosceles trapezoid with bases of lengths k and k-1 and legs of length 1; it consists of a single row of 2k-1 unit triangles. The images show the dance floor for n=4 and the corresponding three tiles.

Attachment novi.png

One of the cells a_1, \ldots, a_n must remain uncovered, as a space for a lighting effect is designated there. The rest of the dance floor must be completely covered using all the available tiles, without overlapping and without extending beyond the boundaries of the dance floor. The tiles may be rotated, and each must cover complete cells of the triangular grid. Let f(n) be the total number of such tilings, where we count both the choice of the uncovered square and the arrangement of the tiles. The board is in a fixed position: arrangements obtained by rotation or reflection are not considered identical, unless the sets of squares occupied by the tiles are the same.

Determine the remainder when f(2026) is divided by 1009.