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 mathematics
Search options not deleted
user 17119
A puzzle related to mathematical facts and objects, whose solution needs mathematical arguments. General mathematics questions are off-topic but can be asked on Mathematics Stack Exchange.
13
votes
3
answers
1k
views
Can the policeman actually catch the thief, instead of shooting?
The ACLU won a lawsuit against the Squareshire Police Department, alleging that his policy of shooting suspected thieves on sight was unconstitutionally excessive force.
The argument that carried the …
9
votes
The infinite flea circus
No; the argument that works in the 2-dimensional case works with essentially no change in $n$ dimensions.
Select a coordinate system such that the $2^n$ fleas start out at positions $\{0,1\}^n$.
Pai …
18
votes
5
answers
1k
views
Maximize the number of paths
You have exactly 990 edges. Assemble them into a simple undirected graph with two distinguished vertices A and B, such that the number of different simple paths from A to B is as large as you can make …
2
votes
Maximize the number of paths
7.96×10130 9.099×10130
The best I have come up with is this "lattice girder" graph (here shown with one possible path highlighted in red):
Between A and B there are 111 layers of 3 nodes each, exc …