# Mathemagic: what happens at the intersection between magic and Math? Talk by: Kush Fanikiso Advised by: Professor Steven J. Miller.

## Presentation on theme: "Mathemagic: what happens at the intersection between magic and Math? Talk by: Kush Fanikiso Advised by: Professor Steven J. Miller."— Presentation transcript:

Mathemagic: what happens at the intersection between magic and Math? Talk by: Kush Fanikiso Email: kf2@williams.edu Advised by: Professor Steven J. Miller

Key ideas The mathematical basis of the trick is that for most orderings of the deck most secret numbers produce the same final key. The truth is that I am not trying to read you, I am playing the game myself and my last card is probably your last card as well. The full technical analysis of this trick uses Geometric distributions and Markov chains to calculate probabilities.

Main idea behind the full proof Lagarias, Rains and Vanderbei use coupling methods for Markov chains to obtain upper and lower bounds on the coupling probability, which represents the failure probability of the Kruskal Count trick. They imagine that they have two independent Markov chains on a finite state space and then find reasonable bounds on the likelihood of those two chains intersecting. The last thing they do is they run 10 6 simulations to see how reasonable their calculations are.

What is the probability that I succeed?

Lets make the assumption that the two chains are equally likely to intersect at any of the 52 cards with a constant probability p 2. Let q = (1 – p 2 ) be the probability that the two chains don’t intersect at any of the 52 cards.

Let I ∈ {1, 2, 3, …, 52} be the random variable which is the card position at which they intersect. This gives us the standard geometric probability distribution: P(I = r) = q r-1 p 2 for r = 1, 2, 3, …

Useful result to keep in mind

We have that:

The probability that I succeed is thus P = 1 – P(I > 52) = 1 – q 52 = 1 – (1 – p 2 ) 52 = 1 – (1 – p 2 ) 52

Now lets find a readsonable estimate for p For each of the two chains the average step size is: This naturally generates a probability of 13/70 and we call p this probability.

So we now have P(succeed) = 1 – P(I > 52) = 1 – [1 – (13/70) 2 ] 52 = 1 – (4731/4900) 52 = 1 – (4731/4900) 52 = 0.8388… = 0.8388…

Table of Theoretical probabilities Picture cards count as Value of pMagician starts with any of the first 10 cards Magician starts with first card 11, 12, 131/765.7770.05 10, 10, 1013/8570.8074.67 5, 5, 513/7083.8886.41 1, 1, 113/5893.1594.40 Letter count1/496.5197.21

Download ppt "Mathemagic: what happens at the intersection between magic and Math? Talk by: Kush Fanikiso Advised by: Professor Steven J. Miller."

Similar presentations