Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

How to get a proof about this formula of "Eulerian Number".
Difference between en1 and en2, changed 66 character(s)
This formula:$A(n, m) = \sum_{i = 0}^{m} (-1)^i {n + 1 \choose i}(m + 1 - i)^n$↵

Eulerian number is the number of permutations of the numbers 1 to n in which exactly m elements are greater than the previous element, or  exactly m elements satisfy P[i] > i(assume the permutation is P). 


Updated: [Here](https://en.wikipedia.org/wiki/Eulerian_number)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English sumerKing 2019-09-06 13:32:36 66
en1 English sumerKing 2019-09-06 13:18:04 347 Initial revision (published)