sumerKing's blog

How to get a proof about this formula of "Eulerian Number".
By sumerKing, history, 5 years ago, In English

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

  • Vote: I like it
  • +4
  • Vote: I do not like it

»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by sumerKing (previous revision, new revision, compare).

→ Reply
»
5 years ago, # |
  Vote: I like it +9 Vote: I do not like it

See here

→ Reply