MathDB
SARAJEVO in a table

Source: JBMO 2009 Shortlist C3

October 14, 2017
JBMOcombinatorics

Problem Statement

a) In how many ways can we read the word SARAJEVO from the table below, if it is allowed to jump from cell to an adjacent cell (by vertex or a side) cell? b) After the letter in one cell was deleted, only 525525 ways to read the word SARAJEVO remained. Find all possible positions of that cell.