WILL_YOU_BE_ALIVE Paul Nahin's "Will You Be Alive 10 Years From Now?" MATLAB Scripts

WILL_YOU_BE_ALIVE, a MATLAB library which contains the scripts used to illustrate Paul Nahin's "Will You Be Alive 10 Years From Now?".

Languages:

WILL_YOU_BE_ALIVE is available in a MATLAB version.

Related Data and Programs:

DIGITAL_DICE, a MATLAB library which contains the scripts used to illustrate Paul Nahin's "Digital Dice".

DUELING_IDIOTS, a MATLAB library which contains the scripts used to illustrate Paul Nahin's "Dueling Idiots".

Reference

• Paul Nahin,
Will You Be Alive 10 Years From Now?,
Princeton, 2014,
ISBN: 978-0691156804,
LC: QA273.25.N344

Source Code:

• airplane_seat.m, the airplane seating puzzle.
• before.m, computes the probability of observing 4 heads before 7 tails.
• black.m, estimates the probability that the last ball drawn is black.
• dd.m, simulates the double dart problem.
• draw.m, simulates a single round of the marble drawing process.
• ds.m, computes the expected number of dice tosses before observing two consecutive 6's.
• final.m, computes the probablity for random A and B that A^2/3+B^2/3 < 1.
• flips.m, estimates chances of an even number of heads in N coin flips.
• galileo.m, computes the frequency of various results when rolling three dice.
• golf.m, probability golf ball in unit square is closer to center than to an edge.
• gr.m, A and B gamble at a dollar a game until one of them is bankrupt.
• inside.m, analyzes the origin in the random triangle in the circle problem.
• jb.m, simulates a James Bernoulli dice problem.
• liar.m, analyzes the liar problem.
• long.m, analyzes a stick-breaking problem.
• marks.m, analyzes the marks problem.
• newton.m, simulates Newton's dice problem.
• obtuse1.m, estimate the probability that a triangle witll be obtuse, if it has side 1 of length 1, and other two sides have lengths uniformly unit random.
• obtuse2.m, estimate the probability that a triangle witll be obtuse.
• plums.m, average distance of closest of n plums to the surface of a unit spherical pudding.
• pp.m, probability of winning pingpong.
• ratio1.m, probability a random ratio is greater than a given limit.
• ratio2.m, probability a random ratio is greater than a given limit.
• spaghetti.m, the spaghetti loop problem.
• square_adj.m, expected distance between random points on adjacent sides of a unit square.
• square_any.m, expected distance between random points in a unit square.
• square_sts.m, expected distance between random points on opposite sides of a unit square.
• squash.m, determines the likelihood that a player will win at squash.
• top.m, analyzes the dreidel game.
• twins.m, the twins problem.

Last revised on 08 May 2019.