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 17907
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
1
vote
Combinatorics- Equal partitions
Solutions to USAMO problems can be found online. See this link: https://mks.mff.cuni.cz/kalva/usa/usoln/usol865.html
- 4,746
20
votes
$P(x)=P(y)$ has infinitely many integer solutions
First it is clear (assuming throughout that $P$ is a solution to your problem) that $P$ should have even degree, for if $P$ has odd degree we have $\lim\limits_{n \rightarrow -\infty}P(n) = -\infty$ a …
- 4,746