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 puzzle
Search options not deleted
user 109573
Recreational mathematics or puzzles with serious mathematical content. Note that math contest problems are generally considered off-topic.
3
votes
Is there an elementary proof of a better result for the finite guessing-box puzzle?
First, an elementary argument that for any fixed $n,$ with $n$ mathematicians and $n$ boxes, and a fixed strategy, there are uncountably many instances where everyone is wrong. Fix $r \in [0,1).$ We'l …
- 4,316