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 30964
A puzzle based on combinatorics, which is the study of counting discrete structures. Use with [mathematics]
3
votes
Reconstructing points based on the sum of their coordinates version 2
Here is a solution with "one component":
- 3,996
5
votes
15 Balls Sorting
I believe this is a procedure that will identify the order with:
I suspect this is similar to Gareth McCaughan's answer, but I didn't take the time to read it all that carefully as it seemed very i …
- 3,996
6
votes
Accepted
21
votes
4
votes
How many gold coins can you extract from the billionaire?
Attempt at a bit more rigor in an answer.
Consider first the strategy of taking 1 coin each turn:
For other strategies:
Comments:
- 3,996
1
vote
Taking turns adding a number 1,2,3 to a 3x3 matrix without repeating numbers in the rows or ...
Without regard for strategy, considering cases:
- 3,996
13
votes
The shorter the message, the larger the prize (version II)
I will give a very weak lower bound (improved based on xnor's idea), and a minor improvement to user1502040's answer.
Lower bound:
Proof:
11111111111111111111 …
- 3,996
12
votes
Accepted
1
vote
Accepted
Maximum filled days
It seems to me there is a knapsack-like quality that would make perfect optimization difficult. (For example, if $d_i$ are rational, asking if it is possible to fill exactly one hour in a particular d …
- 3,996