Skip to main content
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
Search options not deleted user 2233

Applications of mathematics for the design and analysis of games and puzzles

3 votes

Escaping from infinitely many pursuers

In the case that the pursuers have to actually catch the fugitive, this was answered in the article Escaping an infinitude of lions by Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, and Christian Wulff …
Tony Huynh's user avatar
  • 32.1k
9 votes
Accepted

Finite subsets of $S\subseteq \mathbb{N}$ such that $S\setminus\{s\}$ can be partitioned wit...

As conjectured by bof, the answer is all odd $n \geq 7$. Proof. Let $S$ be a set of positive integers such that $S \setminus \{s\}$ can be partitioned into two sets of equal sum for all $s \in S$. By …
Tony Huynh's user avatar
  • 32.1k
7 votes
Accepted

Questions about "The best card trick"

The answer to Question 1 is $52!/48! - 4 \binom{13}{2} \binom{50}{2}= 6115200$. That is, I claim that the number of $4$-tuples that cannot occur is $4 \binom{13}{2} \binom{50}{2}$. To see this, no …
Tony Huynh's user avatar
  • 32.1k
3 votes

Math puzzles for dinner

Here's one that I like that I just heard a few days ago. Alice and Bob play the following game. Alice is randomly dealt 5 cards from an ordinary deck of cards. She is allowed to show Bob 4 of the 5 …
Tony Huynh's user avatar
  • 32.1k
7 votes
Accepted

Separating Heavier from the Lighter Balls

In the comments, Emil Jeřábek and Terry Tao have given an asymptotic lower bound of $4n / \log_2 n$. For the upper bound, $2n$ is trivial, obtained by weighing each ball individually. Here is a so …
Tony Huynh's user avatar
  • 32.1k
18 votes
2 answers
4k views

Turning pants inside-out (or backwards) while tied together

An entertaining topological party trick that I have seen performed is to turn your pants inside-out while having your feet tied together by a piece of string. For a demonstration, check out this vide …
11 votes

Fairest way to choose gifts

Here's an idea. For any partition $(A,B)$ of $[2n]$, where $|A|=|B|=n$, we can ask each child if they prefer $A$ or $B$. If one prefers $A$ and the other prefers $B$, then we are done. Otherwise, t …
Tony Huynh's user avatar
  • 32.1k
4 votes

Math puzzles for dinner

An evil sorceress is holding 100 princes captive. Right now they are all in the same prison cell and can discuss strategy. However, in a moment, they will each be taken to individual prison cells, w …
Nate Eldredge's user avatar
8 votes

Math puzzles for dinner

You have 1000 bottles of wine. Exactly one of the bottles contains a deadly poison, but you don't know which one. The killing time of the poison varies from person to person, but death is imminent i …
Tony Huynh's user avatar
  • 32.1k