Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with closed-form-expressions
Search options not deleted
user 101833
For questions that specifically ask for determining a closed form of equations, integrals etc.
1
vote
2
answers
317
views
Closed form of $\prod_{i=0}^{N}\big(i!\big)^{{N}\choose{i}}$
I have made a question here about closed form of the following:
$$\prod_{k=0}^{N}\big(k!\big)^{{N}\choose{k}}$$
I know that there is a known closed form for,
$$\prod_{i=0}^{N}\big(i!\big)=G(N+2)$$
w …
- 155
4
votes
1
answer
686
views
Approximation a sum involving log and binomial coefficient
I am wondering about the asymptotic approximation of the following expression:
$$S=\sum^{N}_{i=0}\log\Bigg[\binom{\binom{N+1}{i}}{t_i}\Bigg]$$
where
$$t_i=\binom{N}{i}-\binom{N-k}{i-k}+\binom{N-k}{i …
- 155