MathDB
easy permutation

Source: iran2004(com exam)

September 11, 2004
functioncombinatorics proposedcombinatorics

Problem Statement

assume that k,n are two positive integer k≤nk\leq ncount the number of permutation { 1,…,n} \{\ 1,\dots ,n\}\ st for any 1≤i,j≤k1\leq i,j\leq kand any positive integer m we have fm(i)≠jf^m(i)\neq j (fmf^m meas iterarte function,)
Back to ProblemsView on AoPS