Processing math: 100%

Problem #254

Small permutations

For a permutation p of size n, an index r is called ‘small’ if p(r) = \min(p(1), p(2)\dots p(r)). Calculate the number of permutations of size 4040 with exactly 2000 small indices modulo 1000000007.

Contributed by Sawarnik Kaushal

Solved by 21 users

Log in to submit answers.

Is something wrong?

Maintaining a collection of high quality questions is our top priority. If, however, you do find an error, report the problem and we'll make sure it is reviewed soon.