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 |
Asymptotic behavior of functions, asymptotic series and related topics
2
votes
Accepted
Monotonicity of the sum of coefficients of a family of generating functions
Your conjecture is true. First, observe that
\begin{align*}
K_{w+1}(z)&=(1+z)\,K_w(z) & \mbox{ if } w \mbox{ is odd, }\\
K_{w+1}(z)&=(1+z)\,K_w(z) +\frac{1}{2}{w\choose \frac{w}{2}}z^{w/2}(1-z) & …
21
votes
Accepted
Asymptotic expansion of $\sum\limits_{n=1}^{\infty} \frac{x^{2n+1}}{n!{\sqrt{n}} }$
I sketch the arguments for $C(x)$, the arguments for $L(x)$ are essentially the same.
The specific form of the sum suggests probabilistic arguments.
Let $X_x$ be a $\mathrm{Poiss}(x^2)$-distributed …
3
votes
A balls and urns model for a hashing problem
General solution:
assume there are $n$ passwords, $k$ hashes and $x_i$ passwords hashing to $i$. The expected time (drawing without replacement) for the drawing of the first password
with hash $i$ is …