olymmath

Putnam 2005 A2

  • Session A

Let S={(a,b)∣a=1,2,…,n,b=1,2,3}\mathbf{S} = \{(a,b) | a = 1, 2, \dots,n, b = 1,2,3\}. A rook tour of S\mathbf{S} is a polygonal path made up of line segments connecting points p1,p2,…,p3np_1, p_2, \dots, p_{3n} in sequence such that

(i) pi∈Sp_i \in \mathbf{S},

(ii) pip_i and pi+1p_{i+1} are a unit distance apart, for 1≤i<3n1 \leq i <3n,

(iii) for each p∈Sp \in \mathbf{S} there is a unique ii such that pi=pp_i = p. How many rook tours are there that begin at (1,1)(1,1) and end at (n,1)(n,1)?

(An example of such a rook tour for n=5n=5 was depicted in the original.)

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2005/a2 · Tag 400N2PR6DR · Edit this page on GitHub · Keys: j next, k previous