start Harvard statistics, video 2
story proofs, axioms
7:14 2014-10-02
don't loose your common sense
7:14 2014-10-02
!!! NOTICE:
the naive definition assumes that you've
broken your problem into equally likely outcomes
7:26 2014-10-02
one of the most difficult & most important thing
in this course is try to get the habit of trying to
recognize pattern & structure
7:39 2014-10-02
it's not a calculus thing, it's a thinking thing,
you have to think hard.
7:40 2014-10-02
equivalent: how many ways are there to put k indistinguishable
particles into n distringuishable boxes?
7:42 2014-10-02
story proof: proof by interpretation
7:53 2014-10-02
choose who's in the club, then choose who's the president.
7:57 2014-10-02
non-naive definition:
A probability sample consists of S & P
where S == Sample space, P is a function which
takes an event A which is a subset of S as input,
and gives P(A)∈[0,1]
story proofs, axioms
7:14 2014-10-02
don't loose your common sense
7:14 2014-10-02
!!! NOTICE:
the naive definition assumes that you've
broken your problem into equally likely outcomes
7:26 2014-10-02
one of the most difficult & most important thing
in this course is try to get the habit of trying to
recognize pattern & structure
7:39 2014-10-02
it's not a calculus thing, it's a thinking thing,
you have to think hard.
7:40 2014-10-02
equivalent: how many ways are there to put k indistinguishable
particles into n distringuishable boxes?
7:42 2014-10-02
story proof: proof by interpretation
7:53 2014-10-02
choose who's in the club, then choose who's the president.
7:57 2014-10-02
non-naive definition:
A probability sample consists of S & P
where S == Sample space, P is a function which
takes an event A which is a subset of S as input,
and gives P(A)∈[0,1]