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 sequences-and-series
Search options not deleted
user 3206
for questions about sequences and series, e.g. convergence, closed form expressions, etc. Note that there is a different tag for spectral sequences, and also note that MathOverflow is not for homework. Please consider consulting the online encyclopedia for integer sequences, if you are trying to identify a given sequence that you have found in your research.
2
votes
Asymptotic behaviour of sequence
For sums like this, usually one term dominates. Taking $p(n)=n^d$ to play with, consider
when $\binom{(n-k)^d}{k} \lt \binom{(n-k-1)^d}{k+1}$ stops holding. This is not far from
when $(k+1) \lt (\fr …
- 3,209
1
vote
Accepted
Finding the min of a sequence related with factorials
Lemma: Let $n,a$, be positive integers with $r = n \bmod a$, the remainder after
dividing $n$ by $a$. Using Iverson notation [statement] is $1$ if true, $0$ otherwise,
$\lfloor 2n/a \rfloor = 2\lfloo …
- 3,209