Next: Four Solutions to The
BERKELEY MATH CIRCLE 2000-2001
Graph Theory, Oct. 8, 2000
PAUL ZEITZ
UNIVERSITY OF SAN FRANCISCO
- Why is the product of three consecutive integers always divisible by 6?
- Why is
?
- Why is the
th Fibonacci number equal to
- Fermat's Little Theorem states that if
is a prime, then
; in
other words,
is divisible by
. Why is Fermat's Little Theorem true?
- De Moivre's Theorem states that
Why is De Moivre's Theorem true?
- Euler's formula states that
Why is it true?
- Why is the Fundamental Theorem of Calculus true?
- A Problem from BAMM
2000. Consider the
following experiment:
- First a random number
between 0 and 1 is chosen by spinning an arrow
around a dial which is marked from 0 to 1. (This way, the random number is
``uniformly distributed"--the chance that
lies in the interval, say, from
to
is exactly
; and
the chance that
lies in the interval from
to
is exactly
, etc.)
- Then an unfair coin is built so that it lands ``heads up" with
probability
.
- This coin is then flipped 2000 times, and the number of heads seen is
recorded.
What is the probability that exactly 1000 heads were recorded?
Next: Four Solutions to The
Zvezdelina Stankova-Frenkel
2000-11-13