2011-3 Counting functions

Let us write \([n]=\{1,2,\ldots,n\}\). Let \(a_n\) be the number of all functions \(f:[n]\to [n]\) such that \(f([n])=[k]\) for some positive integer \(k\). Prove that \[a_n=\sum_{k=0}^{\infty} \frac{k^n}{2^{k+1}}.\]

GD Star Rating
loading...
2011-3 Counting functions, 3.5 out of 5 based on 17 ratings

5 thoughts on “2011-3 Counting functions

  1. Minjae Park

    노테이션이 잘 이해가 안가는데 f의 도메인과 레인지가 자연수인건가요 아니면 집합인건가요? f:{[n]}→{[n]}이어야하지 않나요?

  2. Minjae Park

    아아… 다시 생각해보니깐 f([n])={f(1),…,f(n)}을 의미하는거겠네요. 잠시 착각했어요ㅋ

Comments are closed.