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 extremal-combinatorics
Search options not deleted
user 61536
18
votes
Dividing a cake between $n-1$, $n$, or $n+1$ guests
Writing down the details of the argument of Ilya Bogdanov, we can obtain the following upper bound:
Theorem. $f(n)\le\frac83n-1$ for every $n\ge 2$.
Proof. If $n=3k+1$ or $n=3k+2$, then following th …
- 41.8k