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 14068
A puzzle based on combinatorics, which is the study of counting discrete structures. Use with [mathematics]
1
vote
A row of 2015 red and white chips
I think:
Asume we have all our chips are red, and we want to turn them white but one.
We can start from one edge choosing every 2 mod 3 chip for some chips (even 0). Then at one point, we stop cho …
- 429
10
votes
A magic trick of David Copperfield
He can put all cards 0 mod 3 in the red hat, all 1 mod 3 in the blue hat and all 2 mod 3 in the yellow hat.
If the sum is 0 mod 3, it can only be obtained from 1+2 mod 3, so the unused hat is red. Th …
- 429