Finding the average distance between 2 points on a hypercube This is the natural extension from this previous post which looked at the average distance of 2 randomly chosen points in a square - this time let's explore the average distance in n dimensions. I'm going to investigate what dimensional hypercube is required to have an... Continue Reading →
Generating e through probability and hypercubes
Generating e through probability and hypercubes This is a really beautiful solution to an interesting probability problem posed by fellow IB teacher Daniel Hwang, for which I've outlined a method for solving suggested by Ferenc Beleznay. The problem is as follows: On average, how many random real numbers from 0 to 1 (inclusive) are required... Continue Reading →