Download presentation

Presentation is loading. Please wait.

Published byJohnny Steadman Modified over 2 years ago

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

2
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.

3
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.

4
What is the probability that I succeed?

5
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.

6
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, …

7
Useful result to keep in mind

8
We have that:

9
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

10
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.

11
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…

12
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

Similar presentations

OK

Section 6.3 Day 1 Binomial Distributions. A Gaggle of Girls Let’s use simulation to find the probability that a couple who has three children has all.

Section 6.3 Day 1 Binomial Distributions. A Gaggle of Girls Let’s use simulation to find the probability that a couple who has three children has all.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on regional trade agreements example Ppt on social etiquettes of israel Ppt on motivational stories Ppt on marie curie's discoveries Ppt on 2 dimensional figures and 3 dimensional slides google Ppt on random access memory Ppt on different occupations in india Ppt on c language fundamentals worksheets Free ppt on brain machine interface project Ppt on fmcg industry in india