Notes and Solutions #6 Meeting of 21 October 2008

Size: px
Start display at page:

Download "Notes and Solutions #6 Meeting of 21 October 2008"

Transcription

1 HAVERFORD COLLEGE PROBLEM SOLVING GROUP Notes and Solutions #6 Meeting of October 008 The Two Envelope Problem ( Box Problem ) An extremely wealthy intergalactic charitable institution has awarded you a genius prize. During the prize ceremony you are offered two sealed envelopes. One of them you don t know which has twice as much money in it as the other. To collect your prize, you will open one envelope and count the cash, and then you may decide whether to keep the money or to switch and take what s in the unopened envelope. What should you do? Or doesn t it matter? Comment You might think that switching and not switching would be equally acceptable strategies, because you are equally uncertain as to which envelope contains the larger amount. The paradox is that switching seems to be the superior option, because (letting x be the amount of money in the envelope you opened) switching offers alternatives between payoffs of x and x/, whose expected value of ½(x) + ½(x/) = 5x/4 exceeds the value in the opened envelope. Hint This one is difficult to simulate with a computer program. Why? Solution Many approaches to this problem start by assuming there is a probability distribution the prior describing the amounts of money you think likely. For example, your prior distribution might be uniform in the range from $0 to $0 6. This means that before opening the first envelope, you figure the probability that the smaller amount is between a and b (and therefore the larger is between a and b) equals (b-a)/(0 6-0) whenever a and b are between 0 and 0 6 and a < b. Alternatively, being a bit of a pessimist, you might suppose that the probability equals e -a e -b no matter what a and b are (provided they aren t negative). This is an interesting assumption because (a) it really is a probability distribution and (b) it assigns some probability, although only a tiny bit, to arbitrarily large amounts. Let s call the prior distribution f, whatever it is. Choosing a prior lets you carry out the calculation of Bayes Theorem. This Theorem is mathematically trivial: starting with the axiomatic relationships P[ B A] P[ A] = P[ BA] = P[ AB] = P[ A B] P [ B] () among the probabilities and conditional probabilities associated with any two events A and B, it is immediate that Oct 8, 008 W:\Haverford\Problems\008-9\Solutions 6.doc

2 [ B A] [ A] P[ A B] = P P P[ B] provided B has nonzero probability of occurring. Observe that () merely gives four ways of expressing the probability that both A and B occur: from left to right, A occurs and then B occurs (given that A has), B and A occur, A and B occur, and B occurs and then A occurs (given that B has). In the present application, we want to know the probability that the unopened envelope contains x given that we saw x in the opened one. The experiment contains two elements of randomness that we have to consider: () A random number ω is drawn from your prior distribution and then () Independently of that, one value is drawn at random from the set {ω, ω}. The sample space, or set of all possible experimental outcomes, can be described as the set of all ordered pairs giving the results of () and (): {( ω, x) ω 0, x ωorx ω} Ω= = =. Some relevant events (sets of outcomes) to think about include { } A(ω) = the random number drawn is ω = (, ),(, ) ωω ω ω, { } B(x) = opened envelope contains x = (, ),( /, ) xx x x, and C = the smaller amount is in the opened envelope = ( ) {, 0} ωω ω. Note for later use that C is statistically independent of A(ω) because it is the result of a physically independent process (() versus ()). Because it is equally likely for either envelope to contain the smaller amount, no matter what value was drawn, the probability of C is P [ C ] = and the probability of its Note, too to keep your sanity when you think about conditional probabilities that a phrase like A occurs given that B has does not mean that B has to occur in time before A did! All it means is that we are limiting our calculations to the experimental outcomes in set B and we intend to compute the relative probability (among all outcomes in B) that the outcome is in A. For example, if B has probability ½ and A has probability /3, then A has /3 / (/) = /3 of all the probability in B. This is the conditional probability of A given B. It is customary to use the lower case Greek omega ω to refer to outcomes, reserving lower case Latin letters x, y, etc. for numerical values associated with those outcomes. This convention reminds us that any experimental procedure usually produces non-numerical results (ω) but that to analyze them mathematically we have to associate numbers (such as x) to those results. As a mathematician, you will immediately recognize that the systematic assignment of numbers to the elements of a set is a function. This is the formal definition of a random variable: a real-valued function on a probability space. Page /7

3 complement, C' = Ω C, is P [ C '] = =. P [ A( ω)] is determined by your prior distribution, so there s nothing more specific we can say about it now; let s just call it f(ω). We can compute the probability of B(x) by recognizing the two ways it can occur: x is drawn and C is true or else x/ is drawn and C is false: P[ Bx ( )] = P[ AxC ( ) ] + P [ Ax ( /) C'] = f( x) + f( x/). Two probability rules justify this calculation: because the event B(x) has been broken into mutually exclusive events A(x)C and A(x/)C', we add their probabilities; because A(x) is (statistically) independent of C (and therefore A(x/) is independent of C'), we can multiply their probabilities. The random choice of envelope to open implies that P [ Bx ( ) Ax ( )] =. (In words: the chance that the opened envelope contains x, given that the amounts x and x were placed in the envelopes, is ½.) Therefore P[ Bx ( ) Ax ( )] P[ Ax ( )] f( x) f( x) P[ Ax ( ) Bx ( )] = = =. () P[ Bx ( )] f( x) + f( x/) f( x) + f( x/) This is the probability that the unopened envelope contains x given that the opened one contains x. The complement of this (conditional) event is that the unopened envelope contains x/, so we obtain its probability by subtracting () from.0. This maneuver is the crux of Bayes theorem: we can easily compute one conditional probability, but what we really need is the conditional probability with the two events A(x) and B(x) reversed. The theorem implies those two probabilities are not usually the same and therein lies the basis of much bad intuition and confusion. At this point we can escape many complications discussed at length in the literature by noting there are only two values of the prior distribution f that need to be considered: f(x) and f(x/). The rest of f is irrelevant! Let s look at some examples before proceeding. Example Suppose you assign nonzero probability only to the possibilities ω in {$, $4, $8}. Consider the prior f($) = 7/0, f($4) = /0, f($8) = /0. We worked out the probabilities of each outcome in Ω by using a probability tree: Page 3/7

4 { } ω: f(ω) x P ( ω x) [, ] $ 7/0 $: 0.7 $4: 0. $8: 0. $4 7/0 $4 /0 $8 /0 $8 /0 $6 /0 There are only four possible values of x to observe. We tabulated them along with the conditional probabilities of ω and the potential gains to be made by switching envelopes: x ω P [ A( ω) Bx ( )] Amount in unopened envelope $ $ $4 $4 $ 7/9 $ $4 $4 /9 $8 $8 $4 /3 $4 $8 $8 /3 $6 $6 $8 $8 Stop for a minute and compute some of these conditional probabilities for yourself. Example Express the amounts in millions of dollars and assume (for the prior distribution) that all values in the interval [0, ] are equally likely. Thus, f(ω) = for ω between zero and one million dollars and f(ω) = 0 otherwise. By our conventions, this means we assume the envelopes can contain between zero and two million dollars, but no more. (i) (ii) If you observe, say, x = 0.6, the value of () is /(+) = ½. You conclude there are equal chances that the unopened envelope contains. or 0.3. If you observe x =., the value of () is 0/(0+) = 0. You conclude there is no chance the unopened envelope contains.4; it is certain to contain 0.6. Page 4/7

5 Example 3 This time, take the prior distribution to be the exponential f(ω) = e -ω. The expression () simplifies to x e P [ Ax ( ) Bx ( )] = =. x x/ x/ e + e + e (i) (ii) If you observe x = 0.6, the probability that the unopened envelope contains the larger amount is /( + e 0.6/ ) The chance of getting. by switching is and the chance of getting 0.3 by switching is = If you observe x =., the probability is /( + e./ ) The chance of getting.4 by switching is and the chance of getting 0.6 by switching is = (End of examples.) One method of choosing a strategy is to convert money into utility which we might as well assume has been done at the outset and to select a strategy that maximizes the expected utility of the choice 3. The utility of keeping the amount in the opened envelope obviously is x. The expected utility of switching is the probability-weighted value of the two possible amounts: f( x) f( x) x+ x/ f( x) + f( x/) f( x) + f( x/). = ( f ( x ) + f ( x /)/) x. (3) f( x) + f( x/) Thus, the Bayesian who really believes in their prior will want to switch when the coefficient of x is greater than unity. This is algebraically equivalent to f( x) > f( x/). Examples, continued Plot the coefficient of x in the utility formula (3): this is the relative utility of switching. 3 We re ignoring the question of risk aversion here. A risk-averse decision maker will prefer to make a choice that has a more certain expectation, all other things being equal. Page 5/7

6 Relative Expectation of Switching Prior distribution is Uniform[0,] Relative Expectation of Switching Prior distribution is f(x )=e -x Switching is the thing to do wherever the graph is above. In the first example (left graph), our strategy should be to switch whenever x and stay pat otherwise. This makes intuitive good sense: when x is small, we switch because we have even chances of getting x and x/, but when x is greater than, our prior says there s no chance of doubling the money. In the second example, we should switch only when x ln(). This, too, agrees with the pessimistic nature of the prior: it has greatest probability density at x = 0 and decreases as x increases. Eventually, as x increases, the prior views the chance of doubling the money as being so low it no longer makes sense to switch. Obviously, the optimal strategy depends on your prior. There is an entirely different route to a solution, an approach that does not depend on choosing a prior. As far as I know, this has not been published. The idea is to make a randomized decision. You will decide to switch envelopes by spinning a dial after observing one envelope s contents x. The dial has a chance δ(x) of telling you not to switch and a chance δ(x) of switching. Reconsider the original experiment: the charity chooses by any means 4 a number y. It puts y and y into the envelopes. You will choose one of them at random. If you choose the one with y in it, your strategy calls for you to spin a dial with δ(y) chance of not switching. That nets you a prize of y with probability δ(y) and a prize of y with probability - δ(y), for an expected amount of yδ(y) + y(-δ(y)) = ( - δ(y))y. This occurs with a chance of ½. There is also a chance of ½ that you choose the envelope with y in it. You will then spin the dial with δ(y) chance of not switching, gaining y with probability δ(y) and y with probability δ(y), for an expected amount of 4 It doesn t have to be random in the sense of being characterized by a prior distribution. An example we mentioned is for the charity to choose either y = n or (/) n with equal probability on the occasion of donating its n th genius prize. There is no long run probability that can describe the values actually appearing in the envelopes! Page 6/7

7 yδ(y) + y( - δ(y)) = y(½ + ½δ(y)). Given that y, although it is a value unknown to you, has definitely been chosen by the charity, your expected winnings are ( yδ( y) + y( δ( y)) ) + ( yδ( y) + y( δ( y)) ) 3 + ( δ( y) δ( y) ) = y. (4) The value of y is not revealed until after all is over, but this procedure guarantees these expected winnings regardless of the value of y. How does this compare with any Bayesian solution? When the envelope with y is opened, the Bayesian will switch provided f( y) > f( y/). When the envelope with y is opened, the switch occurs provided f( y) > f( y). When the Bayesian is good at guessing the likely value of y, she will use the correct strategy in both cases and the expectation of the result is y. Otherwise the expectation is 3y/ (which is no better than always switching or always standing pat) and, in some cases, could be just y. This will happen with any y for which both switching rules are bad: that is, whenever, f( y) > f( y) f( y/)/. (5) Are there any prior distributions with no bad values of y? Define g(x) = log (f( x )) The relations (5) are equivalent to for all x; that is, + g(x+) > g(x) g(x-) g(x) < g(x+) + for all x and g(x) g(x+) + for all x. Obviously this cannot happen. If the Bayesian makes a poor guess of the charity s behavior, then, she could be using the worst possible strategy and consistently choose the smallest amount of money! In contrast to this, the user of a carefully crafted spinner can always do better than always switching or always standing pat, and will never do as badly as the Bayesian might: just let δ be any function that strictly increases and has a range in the interval [0, ]. This will assure that the multiple of y in equation (4) is always strictly greater than 3/. (Actually, we only need that δ(y) > δ(y) for all y > 0.) In particular, any strategy that switches or not independently of the observed amount x is inadmissible, because its expectation is (3/)y for all y: any of the delta-strategies is always better, regardless of what amount is in the envelopes. PS Jake opened an envelope with $5, chose to switch, and won an IOU for $0 that he split with everybody. He used psychological reasoning, not mathematical, and almost regretted it when the second envelope was first opened and no bill was evident! Bill Huber, October 008 Page 7/7

Properties of Arithmetic

Properties of Arithmetic Excerpt from "Prealgebra" 205 AoPS Inc. 4 6 7 4 5 8 22 23 5 7 0 Arithmetic is being able to count up to twenty without taking o your shoes. Mickey Mouse CHAPTER Properties of Arithmetic. Why Start with

More information

6.080 / Great Ideas in Theoretical Computer Science Spring 2008

6.080 / Great Ideas in Theoretical Computer Science Spring 2008 MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

More information

Finite Mathematics : A Business Approach

Finite Mathematics : A Business Approach Finite Mathematics : A Business Approach Dr. Brian Travers and Prof. James Lampes Second Edition Cover Art by Stephanie Oxenford Additional Editing by John Gambino Contents What You Should Already Know

More information

Probability Year 9. Terminology

Probability Year 9. Terminology Probability Year 9 Terminology Probability measures the chance something happens. Formally, we say it measures how likely is the outcome of an event. We write P(result) as a shorthand. An event is some

More information

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Intro to Learning Theory Date: 12/8/16

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Intro to Learning Theory Date: 12/8/16 600.463 Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Intro to Learning Theory Date: 12/8/16 25.1 Introduction Today we re going to talk about machine learning, but from an

More information

MSM120 1M1 First year mathematics for civil engineers Revision notes 4

MSM120 1M1 First year mathematics for civil engineers Revision notes 4 MSM10 1M1 First year mathematics for civil engineers Revision notes 4 Professor Robert A. Wilson Autumn 001 Series A series is just an extended sum, where we may want to add up infinitely many numbers.

More information

Probability Year 10. Terminology

Probability Year 10. Terminology Probability Year 10 Terminology Probability measures the chance something happens. Formally, we say it measures how likely is the outcome of an event. We write P(result) as a shorthand. An event is some

More information

The topics in this section concern with the first course objective.

The topics in this section concern with the first course objective. 1.1 Systems & Probability The topics in this section concern with the first course objective. A system is one of the most fundamental concepts and one of the most useful and powerful tools in STEM (science,

More information

Chapter 1 Review of Equations and Inequalities

Chapter 1 Review of Equations and Inequalities Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve

More information

Solving Polynomial and Rational Inequalities Algebraically. Approximating Solutions to Inequalities Graphically

Solving Polynomial and Rational Inequalities Algebraically. Approximating Solutions to Inequalities Graphically 10 Inequalities Concepts: Equivalent Inequalities Solving Polynomial and Rational Inequalities Algebraically Approximating Solutions to Inequalities Graphically (Section 4.6) 10.1 Equivalent Inequalities

More information

An Even Better Solution to the Paradox of the Ravens. James Hawthorne and Branden Fitelson (7/23/2010)

An Even Better Solution to the Paradox of the Ravens. James Hawthorne and Branden Fitelson (7/23/2010) An Even Better Solution to the Paradox of the Ravens James Hawthorne and Branden Fitelson (7/23/2010) Think of confirmation in the context of the Ravens Paradox this way. The likelihood ratio measure of

More information

2.1 Definition. Let n be a positive integer. An n-dimensional vector is an ordered list of n real numbers.

2.1 Definition. Let n be a positive integer. An n-dimensional vector is an ordered list of n real numbers. 2 VECTORS, POINTS, and LINEAR ALGEBRA. At first glance, vectors seem to be very simple. It is easy enough to draw vector arrows, and the operations (vector addition, dot product, etc.) are also easy to

More information

Algebra Exam. Solutions and Grading Guide

Algebra Exam. Solutions and Grading Guide Algebra Exam Solutions and Grading Guide You should use this grading guide to carefully grade your own exam, trying to be as objective as possible about what score the TAs would give your responses. Full

More information

Uncertainty. Michael Peters December 27, 2013

Uncertainty. Michael Peters December 27, 2013 Uncertainty Michael Peters December 27, 20 Lotteries In many problems in economics, people are forced to make decisions without knowing exactly what the consequences will be. For example, when you buy

More information

Sequential Decisions

Sequential Decisions Sequential Decisions A Basic Theorem of (Bayesian) Expected Utility Theory: If you can postpone a terminal decision in order to observe, cost free, an experiment whose outcome might change your terminal

More information

Park School Mathematics Curriculum Book 1, Lesson 1: Defining New Symbols

Park School Mathematics Curriculum Book 1, Lesson 1: Defining New Symbols Park School Mathematics Curriculum Book 1, Lesson 1: Defining New Symbols We re providing this lesson as a sample of the curriculum we use at the Park School of Baltimore in grades 9-11. If you d like

More information

Conditional probabilities and graphical models

Conditional probabilities and graphical models Conditional probabilities and graphical models Thomas Mailund Bioinformatics Research Centre (BiRC), Aarhus University Probability theory allows us to describe uncertainty in the processes we model within

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10 EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10 Introduction to Basic Discrete Probability In the last note we considered the probabilistic experiment where we flipped

More information

Number Theory. Introduction

Number Theory. Introduction Number Theory Introduction Number theory is the branch of algebra which studies the properties of the integers. While we may from time to time use real or even complex numbers as tools to help us study

More information

Slope Fields: Graphing Solutions Without the Solutions

Slope Fields: Graphing Solutions Without the Solutions 8 Slope Fields: Graphing Solutions Without the Solutions Up to now, our efforts have been directed mainly towards finding formulas or equations describing solutions to given differential equations. Then,

More information

Nondeterministic finite automata

Nondeterministic finite automata Lecture 3 Nondeterministic finite automata This lecture is focused on the nondeterministic finite automata (NFA) model and its relationship to the DFA model. Nondeterminism is an important concept in the

More information

What is proof? Lesson 1

What is proof? Lesson 1 What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might

More information

Intermediate Algebra. Gregg Waterman Oregon Institute of Technology

Intermediate Algebra. Gregg Waterman Oregon Institute of Technology Intermediate Algebra Gregg Waterman Oregon Institute of Technology c 2017 Gregg Waterman This work is licensed under the Creative Commons Attribution 4.0 International license. The essence of the license

More information

1 What is the area model for multiplication?

1 What is the area model for multiplication? for multiplication represents a lovely way to view the distribution property the real number exhibit. This property is the link between addition and multiplication. 1 1 What is the area model for multiplication?

More information

NIT #7 CORE ALGE COMMON IALS

NIT #7 CORE ALGE COMMON IALS UN NIT #7 ANSWER KEY POLYNOMIALS Lesson #1 Introduction too Polynomials Lesson # Multiplying Polynomials Lesson # Factoring Polynomials Lesson # Factoring Based on Conjugate Pairs Lesson #5 Factoring Trinomials

More information

1.4 DEFINITION OF LIMIT

1.4 DEFINITION OF LIMIT 1.4 Definition of Limit Contemporary Calculus 1 1.4 DEFINITION OF LIMIT It may seem strange that we have been using and calculating the values of its for awhile without having a precise definition of it,

More information

the time it takes until a radioactive substance undergoes a decay

the time it takes until a radioactive substance undergoes a decay 1 Probabilities 1.1 Experiments with randomness Wewillusethetermexperimentinaverygeneralwaytorefertosomeprocess that produces a random outcome. Examples: (Ask class for some first) Here are some discrete

More information

Counting. 1 Sum Rule. Example 1. Lecture Notes #1 Sept 24, Chris Piech CS 109

Counting. 1 Sum Rule. Example 1. Lecture Notes #1 Sept 24, Chris Piech CS 109 1 Chris Piech CS 109 Counting Lecture Notes #1 Sept 24, 2018 Based on a handout by Mehran Sahami with examples by Peter Norvig Although you may have thought you had a pretty good grasp on the notion of

More information

Introduction to Computer Science and Programming for Astronomers

Introduction to Computer Science and Programming for Astronomers Introduction to Computer Science and Programming for Astronomers Lecture 8. István Szapudi Institute for Astronomy University of Hawaii March 7, 2018 Outline Reminder 1 Reminder 2 3 4 Reminder We have

More information

The Celsius temperature scale is based on the freezing point and the boiling point of water. 12 degrees Celsius below zero would be written as

The Celsius temperature scale is based on the freezing point and the boiling point of water. 12 degrees Celsius below zero would be written as Prealgebra, Chapter 2 - Integers, Introductory Algebra 2.1 Integers In the real world, numbers are used to represent real things, such as the height of a building, the cost of a car, the temperature of

More information

1.4 Mathematical Equivalence

1.4 Mathematical Equivalence 1.4 Mathematical Equivalence Introduction a motivating example sentences that always have the same truth values can be used interchangeably the implied domain of a sentence In this section, the idea of

More information

1. When applied to an affected person, the test comes up positive in 90% of cases, and negative in 10% (these are called false negatives ).

1. When applied to an affected person, the test comes up positive in 90% of cases, and negative in 10% (these are called false negatives ). CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 8 Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According to clinical trials,

More information

MATH 56A SPRING 2008 STOCHASTIC PROCESSES

MATH 56A SPRING 2008 STOCHASTIC PROCESSES MATH 56A SPRING 008 STOCHASTIC PROCESSES KIYOSHI IGUSA Contents 4. Optimal Stopping Time 95 4.1. Definitions 95 4.. The basic problem 95 4.3. Solutions to basic problem 97 4.4. Cost functions 101 4.5.

More information

LIMITS AND DERIVATIVES

LIMITS AND DERIVATIVES 2 LIMITS AND DERIVATIVES LIMITS AND DERIVATIVES 2.2 The Limit of a Function In this section, we will learn: About limits in general and about numerical and graphical methods for computing them. THE LIMIT

More information

Mathematic 108, Fall 2015: Solutions to assignment #7

Mathematic 108, Fall 2015: Solutions to assignment #7 Mathematic 08, Fall 05: Solutions to assignment #7 Problem # Suppose f is a function with f continuous on the open interval I and so that f has a local maximum at both x = a and x = b for a, b I with a

More information

2.2 Graphs of Functions

2.2 Graphs of Functions 2.2 Graphs of Functions Introduction DEFINITION domain of f, D(f) Associated with every function is a set called the domain of the function. This set influences what the graph of the function looks like.

More information

Week 2: Defining Computation

Week 2: Defining Computation Computational Complexity Theory Summer HSSP 2018 Week 2: Defining Computation Dylan Hendrickson MIT Educational Studies Program 2.1 Turing Machines Turing machines provide a simple, clearly defined way

More information

Section 0.6: Factoring from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative

Section 0.6: Factoring from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Section 0.6: Factoring from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license. 201,

More information

Chapter 9: Roots and Irrational Numbers

Chapter 9: Roots and Irrational Numbers Chapter 9: Roots and Irrational Numbers Index: A: Square Roots B: Irrational Numbers C: Square Root Functions & Shifting D: Finding Zeros by Completing the Square E: The Quadratic Formula F: Quadratic

More information

THE SIMPLE PROOF OF GOLDBACH'S CONJECTURE. by Miles Mathis

THE SIMPLE PROOF OF GOLDBACH'S CONJECTURE. by Miles Mathis THE SIMPLE PROOF OF GOLDBACH'S CONJECTURE by Miles Mathis miles@mileswmathis.com Abstract Here I solve Goldbach's Conjecture by the simplest method possible. I do this by first calculating probabilites

More information

27. THESE SENTENCES CERTAINLY LOOK DIFFERENT

27. THESE SENTENCES CERTAINLY LOOK DIFFERENT 27 HESE SENENCES CERAINLY LOOK DIEREN comparing expressions versus comparing sentences a motivating example: sentences that LOOK different; but, in a very important way, are the same Whereas the = sign

More information

Introducing Proof 1. hsn.uk.net. Contents

Introducing Proof 1. hsn.uk.net. Contents Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction

More information

1 Normal Distribution.

1 Normal Distribution. Normal Distribution.. Introduction A Bernoulli trial is simple random experiment that ends in success or failure. A Bernoulli trial can be used to make a new random experiment by repeating the Bernoulli

More information

STA Module 4 Probability Concepts. Rev.F08 1

STA Module 4 Probability Concepts. Rev.F08 1 STA 2023 Module 4 Probability Concepts Rev.F08 1 Learning Objectives Upon completing this module, you should be able to: 1. Compute probabilities for experiments having equally likely outcomes. 2. Interpret

More information

Unit 2: Solving Scalar Equations. Notes prepared by: Amos Ron, Yunpeng Li, Mark Cowlishaw, Steve Wright Instructor: Steve Wright

Unit 2: Solving Scalar Equations. Notes prepared by: Amos Ron, Yunpeng Li, Mark Cowlishaw, Steve Wright Instructor: Steve Wright cs416: introduction to scientific computing 01/9/07 Unit : Solving Scalar Equations Notes prepared by: Amos Ron, Yunpeng Li, Mark Cowlishaw, Steve Wright Instructor: Steve Wright 1 Introduction We now

More information

ACCUPLACER MATH 0310

ACCUPLACER MATH 0310 The University of Teas at El Paso Tutoring and Learning Center ACCUPLACER MATH 00 http://www.academics.utep.edu/tlc MATH 00 Page Linear Equations Linear Equations Eercises 5 Linear Equations Answer to

More information

27. THESE SENTENCES CERTAINLY LOOK DIFFERENT

27. THESE SENTENCES CERTAINLY LOOK DIFFERENT get the complete book: http://wwwonemathematicalcatorg/getullextullbookhtm 27 HESE SENENCES CERAINLY LOOK DIEREN comparing expressions versus comparing sentences a motivating example: sentences that LOOK

More information

Quadratic Equations Part I

Quadratic Equations Part I Quadratic Equations Part I Before proceeding with this section we should note that the topic of solving quadratic equations will be covered in two sections. This is done for the benefit of those viewing

More information

Algebra. Formal fallacies (recap). Example of base rate fallacy: Monty Hall Problem.

Algebra. Formal fallacies (recap). Example of base rate fallacy: Monty Hall Problem. October 15, 2017 Algebra. Formal fallacies (recap). Example of base rate fallacy: Monty Hall Problem. A formal fallacy is an error in logic that can be seen in the argument's form. All formal fallacies

More information

MATH2206 Prob Stat/20.Jan Weekly Review 1-2

MATH2206 Prob Stat/20.Jan Weekly Review 1-2 MATH2206 Prob Stat/20.Jan.2017 Weekly Review 1-2 This week I explained the idea behind the formula of the well-known statistic standard deviation so that it is clear now why it is a measure of dispersion

More information

Decision Graphs - Influence Diagrams. Rudolf Kruse, Pascal Held Bayesian Networks 429

Decision Graphs - Influence Diagrams. Rudolf Kruse, Pascal Held Bayesian Networks 429 Decision Graphs - Influence Diagrams Rudolf Kruse, Pascal Held Bayesian Networks 429 Descriptive Decision Theory Descriptive Decision Theory tries to simulate human behavior in finding the right or best

More information

Please bring the task to your first physics lesson and hand it to the teacher.

Please bring the task to your first physics lesson and hand it to the teacher. Pre-enrolment task for 2014 entry Physics Why do I need to complete a pre-enrolment task? This bridging pack serves a number of purposes. It gives you practice in some of the important skills you will

More information

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...} WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not

More information

5.1 Increasing and Decreasing Functions. A function f is decreasing on an interval I if and only if: for all x 1, x 2 I, x 1 < x 2 = f(x 1 ) > f(x 2 )

5.1 Increasing and Decreasing Functions. A function f is decreasing on an interval I if and only if: for all x 1, x 2 I, x 1 < x 2 = f(x 1 ) > f(x 2 ) 5.1 Increasing and Decreasing Functions increasing and decreasing functions; roughly DEFINITION increasing and decreasing functions Roughly, a function f is increasing if its graph moves UP, traveling

More information

2) There should be uncertainty as to which outcome will occur before the procedure takes place.

2) There should be uncertainty as to which outcome will occur before the procedure takes place. robability Numbers For many statisticians the concept of the probability that an event occurs is ultimately rooted in the interpretation of an event as an outcome of an experiment, others would interpret

More information

Lecture 3: Probability

Lecture 3: Probability Lecture 3: Probability 28th of October 2015 Lecture 3: Probability 28th of October 2015 1 / 36 Summary of previous lecture Define chance experiment, sample space and event Introduce the concept of the

More information

MAT2342 : Introduction to Applied Linear Algebra Mike Newman, fall Projections. introduction

MAT2342 : Introduction to Applied Linear Algebra Mike Newman, fall Projections. introduction MAT4 : Introduction to Applied Linear Algebra Mike Newman fall 7 9. Projections introduction One reason to consider projections is to understand approximate solutions to linear systems. A common example

More information

May 2015 Timezone 2 IB Maths Standard Exam Worked Solutions

May 2015 Timezone 2 IB Maths Standard Exam Worked Solutions May 015 Timezone IB Maths Standard Exam Worked Solutions 015, Steve Muench steve.muench@gmail.com @stevemuench Please feel free to share the link to these solutions http://bit.ly/ib-sl-maths-may-015-tz

More information

1 Basic Game Modelling

1 Basic Game Modelling Max-Planck-Institut für Informatik, Winter 2017 Advanced Topic Course Algorithmic Game Theory, Mechanism Design & Computational Economics Lecturer: CHEUNG, Yun Kuen (Marco) Lecture 1: Basic Game Modelling,

More information

DECISIONS UNDER UNCERTAINTY

DECISIONS UNDER UNCERTAINTY August 18, 2003 Aanund Hylland: # DECISIONS UNDER UNCERTAINTY Standard theory and alternatives 1. Introduction Individual decision making under uncertainty can be characterized as follows: The decision

More information

Algebra & Trig Review

Algebra & Trig Review Algebra & Trig Review 1 Algebra & Trig Review This review was originally written for my Calculus I class, but it should be accessible to anyone needing a review in some basic algebra and trig topics. The

More information

CHAPTER 8: MATRICES and DETERMINANTS

CHAPTER 8: MATRICES and DETERMINANTS (Section 8.1: Matrices and Determinants) 8.01 CHAPTER 8: MATRICES and DETERMINANTS The material in this chapter will be covered in your Linear Algebra class (Math 254 at Mesa). SECTION 8.1: MATRICES and

More information

Park School Mathematics Curriculum Book 9, Lesson 2: Introduction to Logarithms

Park School Mathematics Curriculum Book 9, Lesson 2: Introduction to Logarithms Park School Mathematics Curriculum Book 9, Lesson : Introduction to Logarithms We re providing this lesson as a sample of the curriculum we use at the Park School of Baltimore in grades 9-11. If you d

More information

Notes on induction proofs and recursive definitions

Notes on induction proofs and recursive definitions Notes on induction proofs and recursive definitions James Aspnes December 13, 2010 1 Simple induction Most of the proof techniques we ve talked about so far are only really useful for proving a property

More information

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2 Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

Lecture for Week 2 (Secs. 1.3 and ) Functions and Limits

Lecture for Week 2 (Secs. 1.3 and ) Functions and Limits Lecture for Week 2 (Secs. 1.3 and 2.2 2.3) Functions and Limits 1 First let s review what a function is. (See Sec. 1 of Review and Preview.) The best way to think of a function is as an imaginary machine,

More information

AP Calculus Chapter 9: Infinite Series

AP Calculus Chapter 9: Infinite Series AP Calculus Chapter 9: Infinite Series 9. Sequences a, a 2, a 3, a 4, a 5,... Sequence: A function whose domain is the set of positive integers n = 2 3 4 a n = a a 2 a 3 a 4 terms of the sequence Begin

More information

YOU CAN BACK SUBSTITUTE TO ANY OF THE PREVIOUS EQUATIONS

YOU CAN BACK SUBSTITUTE TO ANY OF THE PREVIOUS EQUATIONS The two methods we will use to solve systems are substitution and elimination. Substitution was covered in the last lesson and elimination is covered in this lesson. Method of Elimination: 1. multiply

More information

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution Math 38: Graph Theory Spring 2004 Dartmouth College 1 Introduction On Writing Proofs What constitutes a well-written proof? A simple but rather vague answer is that a well-written proof is both clear and

More information

Probability Notes (A) , Fall 2010

Probability Notes (A) , Fall 2010 Probability Notes (A) 18.310, Fall 2010 We are going to be spending around four lectures on probability theory this year. These notes cover approximately the first three lectures on it. Probability theory

More information

( )( b + c) = ab + ac, but it can also be ( )( a) = ba + ca. Let s use the distributive property on a couple of

( )( b + c) = ab + ac, but it can also be ( )( a) = ba + ca. Let s use the distributive property on a couple of Factoring Review for Algebra II The saddest thing about not doing well in Algebra II is that almost any math teacher can tell you going into it what s going to trip you up. One of the first things they

More information

A quadratic expression is a mathematical expression that can be written in the form 2

A quadratic expression is a mathematical expression that can be written in the form 2 118 CHAPTER Algebra.6 FACTORING AND THE QUADRATIC EQUATION Textbook Reference Section 5. CLAST OBJECTIVES Factor a quadratic expression Find the roots of a quadratic equation A quadratic expression is

More information

The Gram-Schmidt Process

The Gram-Schmidt Process The Gram-Schmidt Process How and Why it Works This is intended as a complement to 5.4 in our textbook. I assume you have read that section, so I will not repeat the definitions it gives. Our goal is to

More information

Chapter 11 - Sequences and Series

Chapter 11 - Sequences and Series Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a

More information

CHMC: Finite Fields 9/23/17

CHMC: Finite Fields 9/23/17 CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,

More information

Solving Linear and Rational Inequalities Algebraically. Definition 22.1 Two inequalities are equivalent if they have the same solution set.

Solving Linear and Rational Inequalities Algebraically. Definition 22.1 Two inequalities are equivalent if they have the same solution set. Inequalities Concepts: Equivalent Inequalities Solving Linear and Rational Inequalities Algebraically Approximating Solutions to Inequalities Graphically (Section 4.4).1 Equivalent Inequalities Definition.1

More information

June If you want, you may scan your assignment and convert it to a.pdf file and it to me.

June If you want, you may scan your assignment and convert it to a.pdf file and  it to me. Summer Assignment Pre-Calculus Honors June 2016 Dear Student: This assignment is a mandatory part of the Pre-Calculus Honors course. Students who do not complete the assignment will be placed in the regular

More information

Law of Trichotomy and Boundary Equations

Law of Trichotomy and Boundary Equations Law of Trichotomy and Boundary Equations Law of Trichotomy: For any two real numbers a and b, exactly one of the following is true. i. a < b ii. a = b iii. a > b The Law of Trichotomy is a formal statement

More information

MS 2001: Test 1 B Solutions

MS 2001: Test 1 B Solutions MS 2001: Test 1 B Solutions Name: Student Number: Answer all questions. Marks may be lost if necessary work is not clearly shown. Remarks by me in italics and would not be required in a test - J.P. Question

More information

4.4 Recurrences and Big-O

4.4 Recurrences and Big-O 4.4. RECURRENCES AND BIG-O 91 4.4 Recurrences and Big-O In this section, we will extend our knowledge of recurrences, showing how to solve recurrences with big-o s in them, recurrences in which n b k,

More information

Part 1: You are given the following system of two equations: x + 2y = 16 3x 4y = 2

Part 1: You are given the following system of two equations: x + 2y = 16 3x 4y = 2 Solving Systems of Equations Algebraically Teacher Notes Comment: As students solve equations throughout this task, have them continue to explain each step using properties of operations or properties

More information

33. SOLVING LINEAR INEQUALITIES IN ONE VARIABLE

33. SOLVING LINEAR INEQUALITIES IN ONE VARIABLE get the complete book: http://wwwonemathematicalcatorg/getfulltextfullbookhtm 33 SOLVING LINEAR INEQUALITIES IN ONE VARIABLE linear inequalities in one variable DEFINITION linear inequality in one variable

More information

Partial Fractions. June 27, In this section, we will learn to integrate another class of functions: the rational functions.

Partial Fractions. June 27, In this section, we will learn to integrate another class of functions: the rational functions. Partial Fractions June 7, 04 In this section, we will learn to integrate another class of functions: the rational functions. Definition. A rational function is a fraction of two polynomials. For example,

More information

Equations, Inequalities, and Problem Solving

Equations, Inequalities, and Problem Solving CHAPTER Equations, Inequalities, and Problem Solving. Linear Equations in One Variable. An Introduction to Problem Solving. Formulas and Problem Solving.4 Linear Inequalities and Problem Solving Integrated

More information

Solving Quadratic & Higher Degree Equations

Solving Quadratic & Higher Degree Equations Chapter 9 Solving Quadratic & Higher Degree Equations Sec 1. Zero Product Property Back in the third grade students were taught when they multiplied a number by zero, the product would be zero. In algebra,

More information

Math 54 Homework 3 Solutions 9/

Math 54 Homework 3 Solutions 9/ Math 54 Homework 3 Solutions 9/4.8.8.2 0 0 3 3 0 0 3 6 2 9 3 0 0 3 0 0 3 a a/3 0 0 3 b b/3. c c/3 0 0 3.8.8 The number of rows of a matrix is the size (dimension) of the space it maps to; the number of

More information

Stephen F Austin. Exponents and Logarithms. chapter 3

Stephen F Austin. Exponents and Logarithms. chapter 3 chapter 3 Starry Night was painted by Vincent Van Gogh in 1889. The brightness of a star as seen from Earth is measured using a logarithmic scale. Exponents and Logarithms This chapter focuses on understanding

More information

Chapter 15. Probability Rules! Copyright 2012, 2008, 2005 Pearson Education, Inc.

Chapter 15. Probability Rules! Copyright 2012, 2008, 2005 Pearson Education, Inc. Chapter 15 Probability Rules! Copyright 2012, 2008, 2005 Pearson Education, Inc. The General Addition Rule When two events A and B are disjoint, we can use the addition rule for disjoint events from Chapter

More information

Solutions to 2015 Entrance Examination for BSc Programmes at CMI. Part A Solutions

Solutions to 2015 Entrance Examination for BSc Programmes at CMI. Part A Solutions Solutions to 2015 Entrance Examination for BSc Programmes at CMI Part A Solutions 1. Ten people sitting around a circular table decide to donate some money for charity. You are told that the amount donated

More information

Chapter 6, Factoring from Beginning and Intermediate Algebra by Tyler Wallace is available under a Creative Commons Attribution 3.0 Unported license.

Chapter 6, Factoring from Beginning and Intermediate Algebra by Tyler Wallace is available under a Creative Commons Attribution 3.0 Unported license. Chapter 6, Factoring from Beginning and Intermediate Algebra by Tyler Wallace is available under a Creative Commons Attribution 3.0 Unported license. 2010. 6.1 Factoring - Greatest Common Factor Objective:

More information

Measurements and Data Analysis

Measurements and Data Analysis Measurements and Data Analysis 1 Introduction The central point in experimental physical science is the measurement of physical quantities. Experience has shown that all measurements, no matter how carefully

More information

Chapter 13 - Inverse Functions

Chapter 13 - Inverse Functions Chapter 13 - Inverse Functions In the second part of this book on Calculus, we shall be devoting our study to another type of function, the exponential function and its close relative the Sine function.

More information

MATH MW Elementary Probability Course Notes Part I: Models and Counting

MATH MW Elementary Probability Course Notes Part I: Models and Counting MATH 2030 3.00MW Elementary Probability Course Notes Part I: Models and Counting Tom Salisbury salt@yorku.ca York University Winter 2010 Introduction [Jan 5] Probability: the mathematics used for Statistics

More information

Conceptual Explanations: Radicals

Conceptual Explanations: Radicals Conceptual Eplanations: Radicals The concept of a radical (or root) is a familiar one, and was reviewed in the conceptual eplanation of logarithms in the previous chapter. In this chapter, we are going

More information

August 27, Review of Algebra & Logic. Charles Delman. The Language and Logic of Mathematics. The Real Number System. Relations and Functions

August 27, Review of Algebra & Logic. Charles Delman. The Language and Logic of Mathematics. The Real Number System. Relations and Functions and of August 27, 2015 and of 1 and of 2 3 4 You Must Make al Connections and of Understanding higher mathematics requires making logical connections between ideas. Please take heed now! You cannot learn

More information

Chapter 1A -- Real Numbers. iff. Math Symbols: Sets of Numbers

Chapter 1A -- Real Numbers. iff. Math Symbols: Sets of Numbers Fry Texas A&M University! Fall 2016! Math 150 Notes! Section 1A! Page 1 Chapter 1A -- Real Numbers Math Symbols: iff or Example: Let A = {2, 4, 6, 8, 10, 12, 14, 16,...} and let B = {3, 6, 9, 12, 15, 18,

More information

1 Measurement Uncertainties

1 Measurement Uncertainties 1 Measurement Uncertainties (Adapted stolen, really from work by Amin Jaziri) 1.1 Introduction No measurement can be perfectly certain. No measuring device is infinitely sensitive or infinitely precise.

More information

1.4 Techniques of Integration

1.4 Techniques of Integration .4 Techniques of Integration Recall the following strategy for evaluating definite integrals, which arose from the Fundamental Theorem of Calculus (see Section.3). To calculate b a f(x) dx. Find a function

More information

An analogy from Calculus: limits

An analogy from Calculus: limits COMP 250 Fall 2018 35 - big O Nov. 30, 2018 We have seen several algorithms in the course, and we have loosely characterized their runtimes in terms of the size n of the input. We say that the algorithm

More information