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
3
votes
Asymptotics of a recursion
The first factor telescopes completely, and the second becomes easier by combining $\alpha_{2\kappa}$ with $\beta_{2\kappa+2}$, so
$$
c_{2k} = \frac{1+\ell}{(2k-1)(2+\ell)}\prod_{\kappa=1}^k \left(1-\ …
3
votes
Getting asymptotic behaviour of an integral?
If you need better asymptotics, you would have to use the series expansion of $\frac{1}{1+x}$. …
3
votes
Accepted
How to estimate a summation?
Put $a=|v_1|$, $b=|v_2|$, $c=|v_1v_2|$. Then we have
$$
\sum_{i=0}^a\sum_{j=0}^b\sum_{k=0}^c\binom{a-c}{i-k}\binom{b-c}{j-k}= \sum_{k=0}^c\left(\sum_{i=0}^a\binom{a-c}{i-k}\right)\left(\sum_{j=0}^b\bi …
2
votes
Accepted
Bombieri-Vinogradov in short intervals
As far as I know the Prime Number Theorem in the form $\pi(x+x^\theta)-\pi(x)\sim\frac{x^\theta}{\log x}$ is not proven for any fixed $\theta<\frac{7}{12}$. So I guess the best you could hope for woul …