MathDB

The numbers

1,2,\ldots,100

are written in the cells of a

10\times 10

table, each number is written once. In one move, Nazar may interchange numbers in any two cells. Prove that he may get a table where the sum of the numbers in every two adjacent (by side) cells is composite after at most

35

such moves. N. Agakhanov

Problem Statement