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 29697
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.
4
votes
Is there an entropy proof for bounding a weighted sum of binomial coefficients?
As you said, the sum is $\Pr[X \leq \alpha n]$ where $X$ is drawn from a Binomial distribution with $n$ trials having $p$ probability of success. Bounds on this sum (for $\alpha < p$) are called "tail …
- 4,529
10
votes
What problem would you base your mathcoin on?
Maybe finding good error-correcting codes. For instance, given $q, n, M$, search for a set of $M$ strings, each of length $n$ from a $q$-sized alphabet, with largest $d$, where $d =$ minimum pairwise …
- 4,529