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 co.combinatorics
Search options not deleted
user 6698
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
15
votes
Accepted
Is there an explicit formula for $\sum x^n/(n!)^2$?
This is, for $x \ge 0$, a special case of the modified Bessel function of the first kind. Have a look here: http://mathworld.wolfram.com/ModifiedBesselFunctionoftheFirstKind.html
$$
\sum_{n = 0}^{\inf …
- 1,663
11
votes
Accepted
Squares in an arithmetic progression
The conjecture of Rudin is about the maximum of $A(x; a,b)$, taken over all values of $a$ and $b$. Not with just keeping $a$ and $b$ fixed and letting $x$ get large. So, like you said, if $a$ is not $ …
- 1,663