Abstract: | A permutation (s0, s1,…, sN − 1) of symbols 0, 1,…, N − 1 s called good if the set (t0, t1,…, tN − 1) formed according to the rule ti = i + si (mod N), i = 0, 1,…, N − 1, is a permutation too. A modified fast simulation method is proposed to evaluate the number of good permutations for N = 205 with a 5% relative error. Empirical upper and lower bounds for the number of good permutations are also given. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 101–109, July–August 2008. |