How to get a proof about this formula of "Eulerian Number".

Правка en2, от sumerKing, 2019-09-06 13:32:36

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

Теги #counting, #help

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский sumerKing 2019-09-06 13:32:36 66
en1 Английский sumerKing 2019-09-06 13:18:04 347 Initial revision (published)