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 tag-removed
Search options not deleted
user 4056
This tag is to be used only when re-tagging highly(!) off-topic questions where none of the actual tags would make sense; all actual tags the questioner has used are removed and something is needed to have some tag, which is enforced by the software, so this tag is used. However note that this tag is also used in the process of moderators deleting tags. Thus a question having this tag does most of the time not mean that somebody found it off-topic.
3
votes
2
answers
322
views
How to fill a simplex with almost disjoint cuboids?
There is an algorithm that give us cuboids in $\mathbb{R}^3$, say $Q_1,Q_2,\ldots$, such that $\cup_{i=1}^{\infty} Q_i$ is the simplex with vertices $(0,0,0), (1,0,0) , (0,1,0), (0,0,1)$, and the $Q_i …
- 2,992