Random Walks, Expected Counts and Geometric Chance… | StemPy Lab
Standard content
“Random Walks, Expected Counts and Geometric Chance: Beyond the Textbook” is available to Standard subscribers.
Shuffle ten letters into ten envelopes. On average, how many land in the right place? The answer is one, and a short argument shows why without any long count. Here you find averages with a trick called indicators, and you count with many overlapping events. You follow a gambler and a walker step by step, and you find chances as volumes in a cube. You also meet the famous traps, done honestly with sample spaces. The level is that of JEE Advanced, A-Level Further Maths and IB Higher Level, with a long timed paper.
3Lessons12Problems2Python Labs1Question Set1Mock Test
Expected counts and inclusion-exclusion in depth: Ten letters go into ten envelopes at random. How many land in the right envelope on average? The answer is one, and an idea called an indicator finds it in two lines. This lesson finds averages of counts with indicators. It then counts with many overlapping events by inclusion-exclusion, and checks each answer in two ways.
First-step analysis, the gambler's ruin and random walks: Two friends take turns to throw a die, and the first to throw a six wins. Who is more likely to win? Instead of adding an endless list of chances, look only at the first step and see that the game starts again. This lesson uses that idea for races, for a gambler who plays until ruin or a target, for the wait until a pattern of tosses, and for a walker on a line.
Geometric probability in space and the classic traps: Three numbers are chosen at random between 0 and 1. Can they be the sides of a triangle? The triple is a point in a cube, so the chance is a volume. This lesson finds chances as volumes, shows with Bertrand's chord why "at random" must be said exactly, and works through the famous traps with honest sample spaces. A short simulation checks each hard answer.