Consider a 4×4 grid numbered 1 to 16 left to right then top to bottom. Tile A or Tile B is placed onto the grid so that it covers three adjacent numbers. In how many different ways can Tile B be placed onto the grid (the orientation of the tile may be changed) so that the sum of the uncovered numbers is a multiple of three?
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.