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 combinatorics
Search options not deleted
user 19559
A puzzle based on combinatorics, which is the study of counting discrete structures. Use with [mathematics]
11
votes
Accepted
4
votes
Every tournament has a dominant player
Constructive proof:
Consider a person P who won the greatest number of matches. (If there is a tie for most, choose any of them.) This person is a dominant player.
If P is not a dominant player, the …
- 5,322
1
vote
Find the least number of objects from a jar when those have two colors
Conifers has shown that it's possible to draw 15 candies without drawing 7 of some color. (3 of each type of candy)
To show that 16 candies forces 7 of some color:
#(green-blue) + #(green-red) <= 6
#( …
- 5,322