Mathematics
and Computer Science Speaker Series
California State University, Stanislaus
Date: Friday, May 2, 2008
Time: 4:00 - 5:00 p.m
Room: P102
Speaker: Dana
Reneau
Title: Geometric Probability
Abstract: Probabilities
for many games of chance are calculated using combinatorial or counting
methods. The term “geometric probability” refers to probabilities that
are calculated using measurements, such as angles, lengths, areas, or
volumes, rather than by counting. This talk will start by reviewing
some basic probability concepts in the context of calculating
probabilities for problems involving dice games and card games. This
type of problem will then be contrasted with simple geometric
probability problems such as those involving spinners and dartboards.
From there we will progress to the “triangle” problem, the “meeting in
the park” problem and the classic Buffon needle problem. The
traditional solutions to these geometric probability problems involve
assumptions such as independence and / or uniform distributions. In
addition to discussing those solutions, we will examine how the
probabilities may change if these assumptions are not met.