This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ld help you
Introduction to Prob.
remember the important deﬁnitions and theorems.
11 Limit Laws and Comb 20
V1. Lay 4.1 #9, 12, Random Structures
and Limit Laws
FS: Part C
V2. Lay 4.2 #4, 10, 31
V3. Lay 4.3 #1, 5 presentations) Marni Discrete Limit Laws Sophie Combinatorial
instances of discrete Mariolys 25 IX.4 Continuous Limit Laws Marni 13 30 IX.5 Quasi-Powers and
Gaussian limit laws Sophie 14 Dec 10 Routine questions Presentations Asst #3 Due These are problems you should be able to solve in your sleep :-). Your goal is to be able to answer these
questions quickly and accurately every time. These form the foundations of your skill set. R1. Lay 4.2 #2, 23
R2. Lay 4.3 #13,26 Proofs Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY
Version of: 11-Dec-09 Is the statement true or false? Give a proof if it is true. Give a counterexample if it is false. If it is
false is there the core of a good idea there? Can you add some hypotheses to salvage it?
P1. Lay 4.1 #5, 7
P2. Let V be a vector space and let W and U be subspaces of V . Let W ∩ U be the set of all v in V
which are in both W and U . W ∩ U is a subspace of V ....
View Full Document
This note was uploaded on 10/13/2013 for the course MATH 240 taught by Professor Bojan during the Fall '10 term at Simon Fraser.
- Fall '10