Probability

This page explores Benford's Law: For naturally occurring data, the digits 1 through 9 do not have equal probability of being the first significant digit in a number; the digit 1 has greater odds of being the first significant digit than the others. This law can be used to catch tax fraud because truly random numbers used by embezzlers do not meet this condition.

This page shows how elements of a systems can be eliminated as causes in problem troubleshooting. The principles of twenty questions are frequently used in the business world to conduct computerized searches of massive data bases. These are called a binary searches and are one of the fastest search methods available. To conduct binary searches, data must be sorted in order or alphabetized. The computer determines which half of the list contains the item. The half containing the item is divided in half again and the process repeated until the item is found or the list can no longer be divided. Problem solvers should avoid focusing on the cause and instead ask which elements of the system can be eliminated as causes.

Pseudo random number generators (PRNG) start with a seed value and will eventually repeat all the numbers they generate in exactly the same order. Putting in the same seed value will give precisely the same set of random numbers. On large scale Monte Carlo simulations (depends on generation of multiple random numbers), care has to be taken to make sure that the PRNG cycle is significantly longer than the quantity of random numbers needed or the pattern in the PRNG cycle can show up as an error producing pattern in the simulation results.

This lesson plan uses the Birthday Paradox to introduce basic concepts of probability. Students run a Monte Carlo simulation using the TI-83 graphing calculator to generate random dates, and then search for matching pairs. Students also perform a graphical analysis of the birthday-problem function. Key Words: Permutations; Explicit Function; Recursive Function; Modeling.