Stirling's formula?

  • Thread starter mathstime
  • Start date
  • #1
mathstime
25
0
Hi

I am looking to show that [itex] \binom{|\mathbbm{F}| + n -1}{n} = \frac{1}{n!} |\mathbbm{F}|^n + O(|\mathbbm{F}|^{n-1}) [/itex]

please could someone show me how??
 

Answers and Replies

  • #2
g_edgar
607
0
How about writing the problem: for each [itex]n[/itex],
[tex]
\binom{u+n-1}{n} = \frac{u^n}{n!} + O(u^{n-1})
\quad \text{as } u \to +\infty
[/tex]

If that is what you mean, first try to prove it for [itex]n=1, n=2, n=3[/itex] and see
if you understand those.
 
  • #3
mathstime
25
0
got it! thanks!
 

Suggested for: Stirling's formula?

  • Last Post
Replies
2
Views
1K
Replies
0
Views
2K
  • Last Post
Replies
3
Views
1K
Replies
0
Views
2K
Replies
3
Views
3K
Replies
7
Views
1K
Replies
2
Views
3K
Replies
0
Views
2K
Replies
1
Views
3K
  • Last Post
Replies
6
Views
3K
Top