MathDB

Two permutations of

1,\ldots, n

are written on the board:

a_1,\ldots,a_n

b_1,\ldots,b_n

A move consists of one of the following two operations: 1) Change the first row to

b_{a_1},\ldots,b_{a_n}

2) Change the second row to

a_{b_1},\ldots,a_{b_n}

The starting position is:

2134\ldots n

234\ldots n1

Is it possible by finitely many moves to get:

2314\ldots n

234 \ldots n1

? D. Zmiaikou

Problem Statement