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 answers only
not deleted
user 12176
Recreational mathematics or puzzles with serious mathematical content. Note that math contest problems are generally considered off-topic.
16
votes
Accepted
Can an infinite number of mathematicians guess the number in a box with only one error?
It is possible to have every mathematician guess the number in one of the boxes with at most one error.
Partition the natural numbers into countably many sets, $\{S_i\}_{i=0}^\infty$, where each $S …
- 11.4k
19
votes
Knight tour prime (conjecture)
We can prove something stronger, that there is no path at all. (That is removing the Hamiltonian condition) What follows is a proof for sufficiently large $n$. The proof makes use of the prime numbe …
- 11.4k