Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13"

Transcription

1 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may of the key defiitios. We are goig to formalize some tools to deal with combiatios of evets. Probability Recap The most basic thig is the sample space Ω represetig all the distict possibilites of what the radom experimet could yield. Doig the radom experimet results i exactly oe outcome ω Ω beig selected by ature. (Ad ature here is o-adversarial to us it is ot out to cause us trouble o purpose.) Ω itself might have some iteral structure to it. The most commo case is that Ω cosists of tuples lists ad Ω itself ca be viewed as a Cartesia product Ω 1 Ω 2 Ω, where sometimes the idividual Ω i ca be thought of as sub-experimets that are all doe simultaeously as a part of the larger experimet. However, we are iterested ot just i idividual outcomes, but i sets of possible outcomes. Sets of outcomes are called evets, ad formally, these must be subsets of Ω. The ull subset is a allowable evet, as is the etire set Ω itself. Probability is a fuctio o evets. It obeys certai atural properties, which are sometimes called the axioms of probability. If A is a evet (subset of Ω), Pr[A] 0. This property is called o-egativity. If A is a evet (subset of Ω), Pr[A] 1 with Pr[Ω] = 1. This property is called ormalizatio. If A ad B are evets, ad the evets are disjoit (i.e. A B = /0), the Pr[A B] = Pr[A] + Pr[B]. This property is called additivity. By iductio, it ca easily be exteded to what is called fiite additivity. If A i for i = 1,2,..., are evets that are all disjoit (i.e. for all i j, A i A j = /0), the Pr[ A i ] = Pr[A i ]. This is complemeted, for techical reasos, by a secod additivity axiom that deals with coutably ifiite collectios of evets. If A i for i = 1,2,... are evets that are all disjoit (i.e. for all i j, A i A j = /0), the Pr[ A i ] = Pr[A i ]. For the purposes of EECS70, these two forms of additivity ca just be viewed together. The oly importat thig is that additivity requires you to be able to list all the evets i questio i order, oe at a time. This will oly become a importat restrictio later whe we cosider cotiuous probability. These properties aloe give rise to various useful properties that are largely iherited from set theory, ad we will talk about them i the ext sectio. EECS 70, Sprig 2014, Note 13 1

2 Notrivial combiatios of evets I most applicatios of probability i EECS, we are iterested i thigs like Pr[ A i ] ad Pr[ A i ], where the A i are simple evets (i.e., we kow, or ca easily compute, the Pr[A i ]). The itersectio i A i correspods to the logical AND of the evets A i, while the uio i A i correspods to their logical OR. As a example, if A i deotes the evet that a failure of type i happes i a certai system, the i A i is the evet that the system fails. I geeral, computig the probabilities of such combiatios ca be very difficult. I this sectio, we discuss some situatios where it ca be doe. Let s start with idepedet evets, for which itersectios are quite simple to compute. Idepedet Evets Defiitio 13.1 (idepedece): Two evets A, B i the same probability space are idepedet if Pr[A B] = Pr[A] Pr[B]. Oe ituitio behid this defiitio is the followig. Suppose that Pr[B] > 0. The we have Pr[A B] = Pr[A B] Pr[B] = Pr[A] Pr[B] Pr[B] = Pr[A]. Thus idepedece has the atural meaig that the probability of A is ot affected by whether or ot B occurs. (By a symmetrical argumet, we also have Pr[B A] = Pr[B] provided Pr[A] > 0.) For evets A, B such that Pr[B] > 0, the coditio Pr[A B] = Pr[A] is actually equivalet to the defiitio of idepedece. A deeper ituitio is that idepedece is the way to capture the essece (as far as iferece goes) of the property that two completely urelated subexperimets have to each other. Kowig somethig about oe tells you othig about the other. I fact, several of our previously metioed radom experimets cosist of idepedet evets. For example, if we flip a coi twice, the evet of obtaiig heads i the first trial is idepedet to the evet of obtaiig heads i the secod trial. The same applies for two rolls of a die; the outcomes of each trial are idepedet. The above defiitio geeralizes to ay fiite set of evets: Defiitio 13.2 (mutual idepedece): Evets A 1,...,A are mutually idepedet if for every subset I {1,...,}, Pr[ i I A i ] = i I Pr[A i ]. Note that we eed this property to hold for every subset I. For mutually idepedet evets A 1,...,A, it is ot hard to check from the defiitio of coditioal probability that, for ay 1 i ad ay subset I {1,...,} \ {i}, we have Pr[A i j I A j ] = Pr[A i ]. Note that the idepedece of every pair of evets (so-called pairwise idepedece) does ot ecessarily imply mutual idepedece. For example, it is possible to costruct three evets A,B,C such that each pair is idepedet but the triple A,B,C is ot mutually idepedet. EECS 70, Sprig 2014, Note 13 2

3 Pairwise Idepedece Example Suppose you toss a fair coi twice ad let A be the evet that the first flip is H s ad B be the evet that the secod flip is H s. Now let C be the evet that both flips are the same (i.e. both H s or both T s). Of course A ad B are idepedet. What is more iterestig is that so are A ad C: give that the first toss came up H s, there is still a eve chace that the secod flip is the same as the first. Aother way of sayig this is that P[A C] = P[A]P[C] = 1/4 sice A C is the evet that the first flip is H s ad the secod is also H s. By the same reasoig B ad C are also idepedet. The fact that A should be idepedet of C is ot ituitively obvious at first glace. This is the power of the defiitio of idepedece. It tells us somethig oobvious. O the other had, A, B ad C are ot mutually idepedet. For example if we are give that A ad B occurred the the probability that C occurs is 1. So eve though A, B ad C are ot mutually idepedet, every pair of them are idepedet. I other words, A, B ad C are pairwise idepedet but ot mutually idepedet. Itersectios of evets Computig itersectios of idepedet evets is easy; it follows from the defiitio. We simply multiply the probabilities of each evet. How do we compute itersectios for evets which may ot be idepedet? From the defiitio of coditioal probability, we immediately have the followig product rule (sometimes also called the chai rule) for computig the probability of a itersectio of evets. Theorem 13.1: [Product Rule] For ay evets A,B, we have More geerally, for ay evets A 1,...,A, Pr[A B] = Pr[A]Pr[B A]. Pr[ A i ] = Pr[A 1 ] Pr[A 2 A 1 ] Pr[A 3 A 1 A 2 ] Pr[A 1 A i]. Proof: The first assertio follows directly from the defiitio of Pr[B A] (ad is i fact a special case of the secod assertio with = 2). To prove the secod assertio, we will use iductio o (the umber of evets). The base case is = 1, ad correspods to the statemet that Pr[A] = Pr[A], which is trivially true. For the iductive step, let > 1 ad assume (the iductive hypothesis) that Pr[ 1 A i] = Pr[A 1 ] Pr[A 2 A 1 ] Pr[A 1 2 A i]. Now we ca apply the defiitio of coditioal probability to the two evets A ad 1 A i to deduce that Pr[ A i ] = Pr[A ( 1 A i)] = Pr[A 1 A i] Pr[ 1 A i] = Pr[A 1 A i] Pr[A 1 ] Pr[A 2 A 1 ] Pr[A 1 2 A i], where i the last lie we have used the iductive hypothesis. This completes the proof by iductio. The product rule is particularly useful whe we ca view our sample space as a sequece of choices. The ext few examples illustrate this poit. EECS 70, Sprig 2014, Note 13 3

4 Examples Coi tosses. Toss a fair coi three times. Let A be the evet that all three tosses are heads. The A = A 1 A 2 A 3, where A i is the evet that the ith toss comes up heads. We have Pr[A] = Pr[A 1 ] Pr[A 2 A 1 ] Pr[A 3 A 1 A 2 ] = Pr[A 1 ] Pr[A 2 ] Pr[A 3 ] = = 1 8. The secod lie here follows from the fact that the tosses are mutually idepedet. Of course, we already kow that Pr[A] = 1 8 from our defiitio of the probability space i a earlier lecture ote. Aother way of lookig at this calculatio is that it justifies our defiitio of the probability space, ad shows that it was cosistet with assumig that the coi flips are mutually idepedet. If the coi is biased with heads probability p, we get, agai usig idepedece, Pr[A] = Pr[A 1 ] Pr[A 2 ] Pr[A 3 ] = p 3. Ad more geerally, the probability of ay sequece of tosses cotaiig r heads ad r tails is p r (1 p) r. This is i fact the reaso we defied the probability space this way i the previous lecture ote: we defied the sample poit probabilities so that the coi tosses would behave idepedetly. Moty Hall Recall the Moty Hall problem from a earlier lecture: there are three doors ad the probability that the prize is behid ay give door is 1 3. There are goats behid the other two doors. The cotestat picks a door radomly, ad the host opes oe of the other two doors, revealig a goat. How do we calculate itersectios i this settig? For example, what is the probability that the cotestat chooses door 1, the prize is behid door 2, ad the host chooses door 3? Let A 1 be the evet that the cotestat chooses door 1, let A 2 be the evet that the prize is behid door 2, ad let A 3 be the evet that the host chooses door 3. We would like to compute Pr[A 1 A 2 A 3 ]. By the product rule: Pr[A 1 A 2 A 3 ] = Pr[A 1 ] Pr[A 2 A 1 ] Pr[A 3 A 1 A 2 ] The probability of A 1 is 1 3, sice the cotestat is choosig the door at radom. The probability A 2 give A 1 is still 1 3 sice they are idepedet. The probability of the host choosig door 3 give evets A 1 ad A 2 is 1; the host caot choose door 1, sice the cotestat has already opeed it, ad the host caot choose door 2, sice the host must reveal a goat (ad ot the prize). Therefore, Pr[A 1 A 2 A 3 ] = = 1 9. Observe that we did eed coditioal probability i this settig; had we simply multiplied the probabilities of each evet, we would have obtaied 1 27 sice the probability of A 3 is also 1 3 (ca you figure out why?). What if we chaged the situatio, ad istead asked for the probability that the cotestat chooses door 1, the prize is behid door 1, ad the host chooses door 2? We ca use the same techique as above, but our fial aswer will be differet. This is left as a exercise. EECS 70, Sprig 2014, Note 13 4

5 Aother useful exercise is to use coditioal probability to aalyze the case whe the two goats have differet geders ad Moty is committed to always reveal the locatio of the female goat. (This could be the door that you yourself had chose). I this case, what happes whe Moty reveals the female goat is behid oe of the other two doors? What is the coditioal probability of wiig for switchig vs ot switchig? Poker Hads Let s use the product rule to compute the probability of a flush i a differet way. This is equal to 4 Pr[A], where A is the probability of a Hearts flush. Ituitively, this should be clear sice there are 4 suits; we ll see why this is formally true i the ext sectio. We ca write A = 5 A i, where A i is the evet that the ith card we pick is a Heart. So we have Pr[A] = Pr[A 1 ] Pr[A 2 A 1 ] Pr[A 5 4 A i ]. Clearly Pr[A 1 ] = = 1 4. What about Pr[A 2 A 1 ]? Well, sice we are coditioig o A 1 (the first card is a Heart), there are oly 51 remaiig possibilities for the secod card, 12 of which are Hearts. So Pr[A 2 A 1 ] = Similarly, Pr[A 3 A 1 A 2 ] = 11 50, ad so o. So we get 4 Pr[A] = , which is exactly the same fractio we computed i the previous lecture ote. So ow we have two methods of computig probabilities i may of our sample spaces. It is useful to keep these differet methods aroud, both as a check o your aswers ad because i some cases oe of the methods is easier to use tha the other. Uios of evets You are i Las Vegas, ad you spy a ew game with the followig rules. You pick a umber betwee 1 ad 6. The three dice are throw. You wi if ad oly if your umber comes up o at least oe of the dice. The casio claims that your odds of wiig are 50%, usig the followig argumet. Let A be the evet that you wi. We ca write A = A 1 A 2 A 3, where A i is the evet that your umber comes up o die i. Clearly Pr[A i ] = 1 6 for each i. Therefore, Pr[A] = Pr[A 1 A 2 A 3 ] = Pr[A 1 ] + Pr[A 2 ] + Pr[A 3 ] = = 1 2. Is this calculatio correct? Well, suppose istead that the casio rolled six dice, ad agai you wi iff your umber comes up at least oce. The the aalogous calculatio would say that you wi with probability = 1, i.e., certaily! The situatio becomes eve more ridiculous whe the umber of dice gets bigger tha 6. The problem is that the evets A i are ot disjoit: i.e., there are some sample poits that lie i more tha oe of the A i. (We could get really lucky ad our umber could come up o two of the dice, or all three.) So if we add up the Pr[A i ] we are coutig some sample poits more tha oce. Fortuately, there is a formula for this, kow as the Priciple of Iclusio/Exclusio: Theorem 13.2: [Iclusio/Exclusio] For evets A 1,...,A i some probability space, we have Pr[ A i ] = Pr[A i ] Pr[A i A j ] + Pr[A i A j A k ] ± Pr[ A i ]. {i, j} {i, j,k} EECS 70, Sprig 2014, Note 13 5

6 [I the above summatios, {i, j} deotes all uordered pairs with i j, {i, j, k} deotes all uordered triples of distict elemets, ad so o.] I.e., to compute Pr[ i A i ], we start by summig the evet probabilities Pr[A i ], the we subtract the probabilities of all pairwise itersectios, the we add back i the probabilities of all three-way itersectios, ad so o. We wo t prove this formula here; but you might like to verify it for the special case = 3 by drawig a Ve diagram ad checkig that every sample poit i A 1 A 2 A 3 is couted exactly oce by the formula. You might also like to (hit: do this) prove the formula for geeral by iductio (i similar fashio to the proof of the Product Rule above). Takig the formula o faith, what is the probability we get lucky i the ew game i Vegas? Pr[A 1 A 2 A 3 ] = Pr[A 1 ] + Pr[A 2 ] + Pr[A 3 ] Pr[A 1 A 2 ] Pr[A 1 A 3 ] Pr[A 2 A 3 ] + Pr[A 1 A 2 A 3 ]. Now the ice thig here is that the evets A i are mutually idepedet (the outcome of ay die does ot deped o that of the others), so Pr[A i A j ] = Pr[A i ]Pr[A j ] = ( 1 6 )2 = 1 36, ad similarly Pr[A 1 A 2 A 3 ] = ( 1 6 )3 = So we get Pr[A1 A2 A3] = ( 3 1 ) ( ) = So your odds are quite a bit worse tha the casio is claimig! Whe is large (i.e., we are iterested i the uio of may evets), the Iclusio/Exclusio formula is essetially useless because it ivolves computig the probability of the itersectio of every o-empty subset of the evets: ad there are 2 1 of these! Sometimes we ca just look at the first few terms of it ad forget the rest: ote that successive terms actually give us a overestimate ad the a uderestimate of the aswer, ad these estimates both get better as we go alog. However, i may situatios we ca get a log way by just lookig at the first term: 1. Disjoit evets. If the evets A i are all disjoit (i.e., o pair of them cotai a commo sample poit such evets are also called mutually exclusive), the Pr[ A i ] = Pr[A i ]. [Note that we have already used this fact several times i our examples, e.g., i claimig that the probability of a flush is four times the probability of a Hearts flush clearly flushes i differet suits are disjoit evets.] 2. Uio boud. Always, it is the case that Pr[ A i ] Pr[A i ]. This merely says that addig up the Pr[A i ] ca oly overestimate the probability of the uio. Crude as it may seem, i the ext lecture ote we ll see how to use the uio boud effectively i a core EECS example. EECS 70, Sprig 2014, Note 13 6

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5

More information

3 Basic Definitions of Probability Theory

3 Basic Definitions of Probability Theory 3 Basic Defiitios of Probability Theory 3defprob.tex: Feb 10, 2003 Classical probability Frequecy probability axiomatic probability Historical developemet: Classical Frequecy Axiomatic The Axiomatic defiitio

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

MARTINGALES AND A BASIC APPLICATION

MARTINGALES AND A BASIC APPLICATION MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this

More information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009) 18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

CS103X: Discrete Structures Homework 4 Solutions

CS103X: Discrete Structures Homework 4 Solutions CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Hypothesis testing. Null and alternative hypotheses

Hypothesis testing. Null and alternative hypotheses Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

THE ABRACADABRA PROBLEM

THE ABRACADABRA PROBLEM THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Notes on exponential generating functions and structures.

Notes on exponential generating functions and structures. Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the

More information

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

The Stable Marriage Problem

The Stable Marriage Problem The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,

More information

Overview of some probability distributions.

Overview of some probability distributions. Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability

More information

3. Greatest Common Divisor - Least Common Multiple

3. Greatest Common Divisor - Least Common Multiple 3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

Math C067 Sampling Distributions

Math C067 Sampling Distributions Math C067 Samplig Distributios Sample Mea ad Sample Proportio Richard Beigel Some time betwee April 16, 2007 ad April 16, 2007 Examples of Samplig A pollster may try to estimate the proportio of voters

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas: Chapter 7 - Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries

More information

Present Value Factor To bring one dollar in the future back to present, one uses the Present Value Factor (PVF): Concept 9: Present Value

Present Value Factor To bring one dollar in the future back to present, one uses the Present Value Factor (PVF): Concept 9: Present Value Cocept 9: Preset Value Is the value of a dollar received today the same as received a year from today? A dollar today is worth more tha a dollar tomorrow because of iflatio, opportuity cost, ad risk Brigig

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

Hypergeometric Distributions

Hypergeometric Distributions 7.4 Hypergeometric Distributios Whe choosig the startig lie-up for a game, a coach obviously has to choose a differet player for each positio. Similarly, whe a uio elects delegates for a covetio or you

More information

Chapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity

More information

Simple Annuities Present Value.

Simple Annuities Present Value. Simple Auities Preset Value. OBJECTIVES (i) To uderstad the uderlyig priciple of a preset value auity. (ii) To use a CASIO CFX-9850GB PLUS to efficietly compute values associated with preset value auities.

More information

1. C. The formula for the confidence interval for a population mean is: x t, which was

1. C. The formula for the confidence interval for a population mean is: x t, which was s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : p-value

More information

A PROBABILISTIC VIEW ON THE ECONOMICS OF GAMBLING

A PROBABILISTIC VIEW ON THE ECONOMICS OF GAMBLING A PROBABILISTIC VIEW ON THE ECONOMICS OF GAMBLING MATTHEW ACTIPES Abstract. This paper begis by defiig a probability space ad establishig probability fuctios i this space over discrete radom variables.

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

Case Study. Normal and t Distributions. Density Plot. Normal Distributions

Case Study. Normal and t Distributions. Density Plot. Normal Distributions Case Study Normal ad t Distributios Bret Halo ad Bret Larget Departmet of Statistics Uiversity of Wiscosi Madiso October 11 13, 2011 Case Study Body temperature varies withi idividuals over time (it ca

More information

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS

More information

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights Ceter, Spread, ad Shape i Iferece: Claims, Caveats, ad Isights Dr. Nacy Pfeig (Uiversity of Pittsburgh) AMATYC November 2008 Prelimiary Activities 1. I would like to produce a iterval estimate for the

More information

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number. GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea - add up all

More information

Engineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51

Engineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51 Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log

More information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio

More information

Convexity, Inequalities, and Norms

Convexity, Inequalities, and Norms Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

More information

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the.

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the. Cofidece Itervals A cofidece iterval is a iterval whose purpose is to estimate a parameter (a umber that could, i theory, be calculated from the populatio, if measuremets were available for the whole populatio).

More information

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature. Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.

More information

LECTURE 13: Cross-validation

LECTURE 13: Cross-validation LECTURE 3: Cross-validatio Resampli methods Cross Validatio Bootstrap Bias ad variace estimatio with the Bootstrap Three-way data partitioi Itroductio to Patter Aalysis Ricardo Gutierrez-Osua Texas A&M

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here). BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly

More information

Betting on Football Pools

Betting on Football Pools Bettig o Football Pools by Edward A. Beder I a pool, oe tries to guess the wiers i a set of games. For example, oe may have te matches this weeked ad oe bets o who the wiers will be. We ve put wiers i

More information

Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.

Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k. 18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The

More information

Factors of sums of powers of binomial coefficients

Factors of sums of powers of binomial coefficients ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the

More information

I. Why is there a time value to money (TVM)?

I. Why is there a time value to money (TVM)? Itroductio to the Time Value of Moey Lecture Outlie I. Why is there the cocept of time value? II. Sigle cash flows over multiple periods III. Groups of cash flows IV. Warigs o doig time value calculatios

More information

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized? 5.4 Amortizatio Questio 1: How do you fid the preset value of a auity? Questio 2: How is a loa amortized? Questio 3: How do you make a amortizatio table? Oe of the most commo fiacial istrumets a perso

More information

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction THE ARITHMETIC OF INTEGERS - multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,

More information

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find 1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.

More information

CHAPTER 3 THE TIME VALUE OF MONEY

CHAPTER 3 THE TIME VALUE OF MONEY CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all

More information

Elementary Theory of Russian Roulette

Elementary Theory of Russian Roulette Elemetary Theory of Russia Roulette -iterestig patters of fractios- Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing SIAM REVIEW Vol. 44, No. 1, pp. 95 108 c 2002 Society for Idustrial ad Applied Mathematics Perfect Packig Theorems ad the Average-Case Behavior of Optimal ad Olie Bi Packig E. G. Coffma, Jr. C. Courcoubetis

More information

A Mathematical Perspective on Gambling

A Mathematical Perspective on Gambling A Mathematical Perspective o Gamblig Molly Maxwell Abstract. This paper presets some basic topics i probability ad statistics, icludig sample spaces, probabilistic evets, expectatios, the biomial ad ormal

More information

1. MATHEMATICAL INDUCTION

1. MATHEMATICAL INDUCTION 1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1

More information

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern. 5.5 Fractios ad Decimals Steps for Chagig a Fractio to a Decimal. Simplify the fractio, if possible. 2. Divide the umerator by the deomiator. d d Repeatig Decimals Repeatig Decimals are decimal umbers

More information

INFINITE SERIES KEITH CONRAD

INFINITE SERIES KEITH CONRAD INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal

More information

CHAPTER 3 DIGITAL CODING OF SIGNALS

CHAPTER 3 DIGITAL CODING OF SIGNALS CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity

More information

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL. Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS Chapter 7 PERMUTATIONS AND COMBINATIONS Every body of discovery is mathematical i form because there is o other guidace we ca have DARWIN 7.1 Itroductio Suppose you have a suitcase with a umber lock. The

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means)

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means) CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:

More information

Lecture 4: Cheeger s Inequality

Lecture 4: Cheeger s Inequality Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular

More information

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006 Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam

More information

Trading the randomness - Designing an optimal trading strategy under a drifted random walk price model

Trading the randomness - Designing an optimal trading strategy under a drifted random walk price model Tradig the radomess - Desigig a optimal tradig strategy uder a drifted radom walk price model Yuao Wu Math 20 Project Paper Professor Zachary Hamaker Abstract: I this paper the author iteds to explore

More information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee

More information

A Recursive Formula for Moments of a Binomial Distribution

A Recursive Formula for Moments of a Binomial Distribution A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,

More information

Maximum Likelihood Estimators.

Maximum Likelihood Estimators. Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio

More information

Chapter 5: Inner Product Spaces

Chapter 5: Inner Product Spaces Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples

More information

Z-TEST / Z-STATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown

Z-TEST / Z-STATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown Z-TEST / Z-STATISTIC: used to test hypotheses about µ whe the populatio stadard deviatio is kow ad populatio distributio is ormal or sample size is large T-TEST / T-STATISTIC: used to test hypotheses about

More information

Solving Logarithms and Exponential Equations

Solving Logarithms and Exponential Equations Solvig Logarithms ad Epoetial Equatios Logarithmic Equatios There are two major ideas required whe solvig Logarithmic Equatios. The first is the Defiitio of a Logarithm. You may recall from a earlier topic:

More information

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please

More information

Lesson 17 Pearson s Correlation Coefficient

Lesson 17 Pearson s Correlation Coefficient Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) -types of data -scatter plots -measure of directio -measure of stregth Computatio -covariatio of X ad Y -uique variatio i X ad Y -measurig

More information

Measures of Spread and Boxplots Discrete Math, Section 9.4

Measures of Spread and Boxplots Discrete Math, Section 9.4 Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,

More information

Building Blocks Problem Related to Harmonic Series

Building Blocks Problem Related to Harmonic Series TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite

More information

Uncertainty Chapter 13. Mausam (Based on slides by UW-AI faculty)

Uncertainty Chapter 13. Mausam (Based on slides by UW-AI faculty) Ucertait Chapter 3 Mausam Based o slides b UW-AI facult Kowledge Represetatio KR Laguage Otological Commitmet Epistemological Commitmet ropositioal Logic facts true false ukow First Order Logic facts objects

More information

Class Meeting # 16: The Fourier Transform on R n

Class Meeting # 16: The Fourier Transform on R n MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,

More information

Analysis Notes (only a draft, and the first one!)

Analysis Notes (only a draft, and the first one!) Aalysis Notes (oly a draft, ad the first oe!) Ali Nesi Mathematics Departmet Istabul Bilgi Uiversity Kuştepe Şişli Istabul Turkey aesi@bilgi.edu.tr Jue 22, 2004 2 Cotets 1 Prelimiaries 9 1.1 Biary Operatio...........................

More information

GCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4

GCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4 GCE Further Mathematics (660) Further Pure Uit (MFP) Tetbook Versio: 4 MFP Tetbook A-level Further Mathematics 660 Further Pure : Cotets Chapter : Comple umbers 4 Itroductio 5 The geeral comple umber 5

More information

Solutions to Exercises Chapter 4: Recurrence relations and generating functions

Solutions to Exercises Chapter 4: Recurrence relations and generating functions Solutios to Exercises Chapter 4: Recurrece relatios ad geeratig fuctios 1 (a) There are seatig positios arraged i a lie. Prove that the umber of ways of choosig a subset of these positios, with o two chose

More information

The Power of Free Branching in a General Model of Backtracking and Dynamic Programming Algorithms

The Power of Free Branching in a General Model of Backtracking and Dynamic Programming Algorithms The Power of Free Brachig i a Geeral Model of Backtrackig ad Dyamic Programmig Algorithms SASHKA DAVIS IDA/Ceter for Computig Scieces Bowie, MD sashka.davis@gmail.com RUSSELL IMPAGLIAZZO Dept. of Computer

More information

Lecture 5: Span, linear independence, bases, and dimension

Lecture 5: Span, linear independence, bases, and dimension Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

THE HEIGHT OF q-binary SEARCH TREES

THE HEIGHT OF q-binary SEARCH TREES THE HEIGHT OF q-binary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average

More information

Determining the sample size

Determining the sample size Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors

More information

Theorems About Power Series

Theorems About Power Series Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

More information

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This

More information

Entropy of bi-capacities

Entropy of bi-capacities Etropy of bi-capacities Iva Kojadiovic LINA CNRS FRE 2729 Site école polytechique de l uiv. de Nates Rue Christia Pauc 44306 Nates, Frace iva.kojadiovic@uiv-ates.fr Jea-Luc Marichal Applied Mathematics

More information