A2. Find all permutations a1, a2, ... , a9 of 1, 2, ... , 9 such that a1 + a2 + a3 + a4 = a4 + a5 + a6 + a7 = a7 + a8 + a9 + a1 and a12 + a22 + a32 + a42 = a42 + a52 + a62 + a72 = a72 + a82 + a92 + a12.
|
|
A5. Given a permutation s0, s2, ... , sn of 0, 1, 2, .... , n, we may transform it if we can find i, j such that si = 0 and sj = si-1 + 1. The new permutation is obtained by transposing si and sj. For which n can we obtain (1, 2, ... , n, 0) by repeated transformations starting with (1, n, n-1, .. , 3, 2, 0)?
|
|