4.4 Mathematical induction

Size: px
Start display at page:

Download "4.4 Mathematical induction"

Transcription

1 4.4 Mathematical induction This section treats three kinds of induction: Ordinary or weak mathematical induction (which you are probably already familiar with), strong mathematical induction, and structural induction, which we study later. Consider the inductive definition of a set S of integers, as follows: Basis: n 0 S. Induction: If n S, then so is n+1. Then, to prove P(n) for all n S, by (weak) mathematical induction, it suffices to prove that Basis: P(n 0), and Induction: for all n S, if P(n), then P(n+1). Often people distinguish between strong and weak mathematical induction...

2 An example of weak mathematical induction I d like you to follow a fairly rigid format in presenting proofs by weak mathematical induction. Here s an example. Claim: For all n 4, n! > 2 n. Proof by weak mathematical induction on n (n n 0 = 4). Basis: n 0 = 4 4! = 24 > 16 = 2 4. Induction: IH: n! > 2 n NTS: (n+1)! > 2 n+1 (n+1)! = n! (n+1) (def of!) > 2 n (n+1) (IH) > 2 n 2 (n 4) = 2 n+1 OK, so what is essential about this proof?...

3 Format for weak mathematical induction proof In this class, please use the format of the previous example for proofs by weak mathematical induction. Essential elements: Say what Claim you are proving (the Claim). Say that the proof is by weak mathematical induction. Make it clear what the value of n 0 is. Divide the argument into basis and induction cases, labeled as such. In the induction case, state the induction hypothesis (IH) and what you need to show (NTS). Indicate clearly where and how you use the IH.

4 More weak mathematical induction examples Claim: For all n N, n i=0 i = n2 +n 2 Proof by (weak) mathematical induction on n (n n 0 = 0).. Basis: n 0 = 0 0 i=0 i = 0 = Induction: IH: NTS: n i=0 i = n2 +n 2. n+1 i=0 i = (n+1)2 +(n+1) 2. n+1 i=0 i = ( n ( i=0) i) +n+1 = +n+1 n 2 +n 2 = n2 +n+2n+2 2 = (n2 +2n+1)+(n+1) 2 = (n+1)2 +(n+1) 2 (IH)

5 Claim: For all n N, n(n 2 +5) is a multiple of 6. Proof by (weak) mathematical induction on n (n n 0 = 0). Basis: n 0 = 0 0(0 2 +5) = 0 = 6 0. Induction: IH: n(n 2 +5) is a multiple of 6. NTS: (n+1)((n+1) 2 +5) is a multiple of 6. (n+1)((n+1) 2 +5) = (n+1)(n 2 +2n +6) = (n+1)(n 2 +5)+(n+1)(2n +1) = n(n 2 +5)+(n 2 +5)+(n+1)(2n+1) = n(n 2 +5)+(n 2 +5)+(2n 2 +3n+1) = n(n 2 +5)+(3n 2 +3n +6) = n(n 2 +5)+3(n 2 +n)+6 Now, to show that the rhs sum is a multiple of 6, we show that all three summands are. By IH, n(n 2 +5) is a multiple of 6. Of course 6 is also. To show that 3(n 2 +n) is a multiple of 6, it is enough to show that n 2 +n is even, which follows easily from the fact that n 2 +n = n(n+1) and so is the product of an odd and an even number.

6 A harder example of weak mathematical induction Claim: For any language L (over alphabet A), if L 2 L, then L + L. Let s prove this by mathematical induction. Question: Where is the parameter n? Recall that L + = n NL n+1. So we can establish the claim by showing that if L 2 L, then for all n N, L n+1 L.

7 We ll need the following easy lemma. Lemma: For all L 1,L 2,M A, if L 1 L 2, then L 1M L 2M. Proof. Assume L 1 L 2 and x L 1M. [What is our goal?] So there exist y L 1 and z M s.t. x = yz. Since L 1 L 2 and y L 1, we have y L 2. And since y L 2 and z M, we have x = yz L 2M.

8 Lemma: For all L 1,L 2,M A, if L 1 L 2, then L 1M L 2M. Claim: For any language L, if L 2 L, then L + L. Proof. Assume that L 2 L. We will prove by weak mathematical induction that it follows that, for all n N, L n+1 L, from which it follows in turn that L + L, since L + = n N Ln+1. Basis: n 0 = 0 L 0+1 = L 1 = L, so L 0+1 L. Induction: IH: L n+1 L. NTS: L (n+1)+1 L. L n+2 = L n+1 L (def L n+2 ) LL (IH, Lemma) = L 2 (def L 2 ) L (assumption)

9 Strong mathematical induction Let S = {n 0,n 0 +1,n 0 +2,...} be the set of intergers n 0. Let P be a property of integers. To prove P(n) for all integers n n 0, by strong mathematical induction, it suffices to prove that Basis: P(n 0),P(n 0 +1),P(n 0 +2),...,P(n 1) (where n 1 n 0), and Induction: for all n > n 1, if P(m), for n 0 m n, then P(n+1). Notice that here you get a stronger induction hypothesis: instead of assuming only P(n) in order to prove P(n+1), you can assume P(k) for all k {n 0,n 0 +1,...,n}. That s why this is called strong mathematical induction.

10 An example of strong mathematical induction A typical first example involves Fibonacci numbers, defined recursively as: Basis: F 0 = 0 and F 1 = 1 (so n 0 = 0 and n 1 = 1) Induction: for n 0, F n+2 = F n +F n+1 Weak induction is usually less convenient for proofs about F n for all n N, since F n+2 is defined in terms of both F n and F n+1. Claim: For every n N, n i=0fi = Fn+2 1. Proof by strong mathematical induction on n (n 0). The base cases are n 0 = 0 and n 1 = 1 Basis Case 1: n = 0. 0 i=0 Fi = F0 = (F 0 +1) 1 = (F 0 +F 1) 1 (defn F 1) = F 2 1 (defn F 2) Basis Case 2: n = 1. 1 i=0fi = F0 +F1 = F 2 (defn F 2) = (1+F 2) 1 = (F 1 +F 2) 1 (defn F 1) = F 3 1 (defn F 3)

11 Claim: For every n N, n i=0fi = Fn+2 1. Induction: n 2. IH: For all k, 0 k n, k i=0 Fi = F k+2 1. NTS: n+1 i=0 Fi = Fn+3 1. n+1 i=0 Fi = n 1 i=0 Fi +(Fn +Fn+1) (n 2) = (F n+1 1)+(F n +F n+1) (IH) = (F n+1 1)+F n+2 (defn F n+2, n 0) = (F n+1 +F n+2) 1 = F n+3 1 (defn F n+3)

12 Format for strong mathematical induction proof In this class, please use the format of the previous example for proofs by strong mathematical induction. Essential elements: Say what Claim you are proving (the Claim). Say that the proof is by strong mathematical induction. Make it clear what the values of n 0 and n 1 are (and if there is only one basis case that n 0 = n 1). Divide the argument into basis and induction cases, labeled as such. In the induction case, state the induction hypothesis (IH) and what you need to show (NTS). Indicate clearly where and how you use the IH.

13 Structural induction We now introduce structural induction ( called well-founded induction in the text), a powerful method for proving claims about inductively-defined sets... In structural induction, the structure of the inductive proof (that every element of a set S has some property) follows the structure of the inductive definition (of S). For instance, to prove that every binary tree T (over A) has a property P, we would simply argue that P( ), and for all binary trees L and R (and all x A), if P(L) and P(R), then P( L,x,R ). (Compare the structure of this argument to the structure of the inductive defn of the set of binary trees over A.) NOTE: It isn t necessary to understand the basis of well-founded induction as presented in the text it is enough to understand structural induction as presented in these notes.

14 Soundness of structural induction Let S be an inductively-defined set. Let P(x) be a property of x. Claim. To show that, for all x S, P(x), it suffices to show that: Basis: For all initial elements x of S, P(x). Induction: For each construction rule using elements x 1,...,x k of S to construct an element x, show that if P(x 1,),...,P(x k ), then P(x). Let s verify the soundness of this claim... So assume that we can meet the obligations of the proof by structural induction described above. What we ll show is that the set S P = {x x S,P(x)} satisfies both the basis and induction parts of the inductive definition of S. It follows that S P is a superset of S (WHY?), and so that, for every x S, P(x).

15 Let S be an inductively-defined set. To prove P(x) for all x S, it suffices to show that: Basis: For all initial elements x of S, P(x). Induction: For each construction rule using elements x 1,...,x k of S to construct an element x, show that if P(x 1,),...,P(x k ), then P(x). Assuming that we can meet the proof obligations given above, we can show that it follows that the set S P = {x x S,P(x)} satisfies both the basis and induction parts of the inductive definition of S. [Hence, S S p. Thus, for all x S, P(x).] Notice first that the basis part of the structural induction proof establishes that S P satisfies the basis part of the inductive definition of S. (That is, all initial elements of S have property P, and so belong to S p.) The inductive part of the structural induction proof establishes that, for any x 1,...,x n S p, if x can be constructed from x 1,...,x n (by the inductive definition of S), then x S P. (So S P also satisfies the induction part of the defn of S.)

16 Structural induction example 1 (Ex. 10 b. p.275) Let BT be the set of binary trees over A, and consider the function f : BT N defined recursively as follows. f( ) = { 0 1, if L = R = f( L,x,R ) = f(l)+f(r), otherwise Prove: For all T BT, f(t) is the number of leaves in T. By structural induction on T. Basis: f( ) = 0, which is the number of leaves in. Induction: L,R BT, x A. IH: f(l) is the number of leaves in L and f(r) is the number of leaves in R. NTS: f( L,x,R ) is the number of leaves in L,x,R. Subcase 1: L = R = In this subcase, the number of leaves in L,x,R is 1 = f( L,x,R ). Subcase 2: Otherwise. Here, the number of leaves in L,x,R is the number of leaves in L plus the number of leaves in R, which, by IH, is exactly f(l)+f(r) = f( L,x,R ).

17 Structural induction example 2 (not in text) Claim: For every binary tree T over A, 2 depth(t)+1 nodes(t)+1. Proof by structural induction (on the inductive definition of BT over A). Basis: 2 depth( )+1 = 1 = nodes( )+1. Induction: L,R BT, and x A. IH: 2 depth(l)+1 nodes(l)+1 and 2 depth(r)+1 nodes(r)+1. NTS: 2 depth( L,x,R )+1 nodes( L,x,R )+1. 2 depth( L,x,R )+1 = 2 2 depth( L,x,R ) = 2 2 max(depth(l),depth(r))+1 (defn depth) = 2 2 max(depth(l)+1,depth(r)+1) = 2 max(2 depth(l)+1,2 depth(r)+1 ) 2 max(nodes(l)+1,nodes(r)+1) (IH) = (2 max(nodes(l),nodes(r)))+2 (nodes(l) + nodes(r)) + 2 = (nodes(l)+nodes(r)+1)+1 = nodes( L, x, R ) + 1 (defn nodes)

18 Structural induction example 3 (Ex. 5 a. p.174) Recall: For any alphabet A, A can be defined inductively as follows: Basis: Λ A. Induction: If x A and a A, then ax A. And here s the recursively defined reversing function we ve discussed before: Take r : A A s.t. r(λ) = Λ r(ax) = r(x)a (x A,a A) Claim: For all x,y A, r(xy) = r(y)r(x). Hmmm, should we induct on x or on y? You can try it both ways. One way is much nicer...

19 For any alphabet A, A is defined inductively as follows: Basis: Λ A. Induction: If x A and a A, then ax A. Take r : A A s.t. r(λ) = Λ r(ax) = r(x)a (x A,a A) Claim: For all x,y A, r(xy) = r(y)r(x). Take an arbitrary y A. We ll prove, by structural induction on the inductive defn of A, that for all x A, r(xy) = r(y)r(x). Basis: Induction: x A, a A IH: r(xy) = r(y)r(x) NTS: r(axy) = r(y)r(ax) r(λy) = r(y) = r(y)λ = r(y)r(λ) (defn r) r(axy) = r(xy)a (defn r) = r(y)r(x)a (IH) = r(y)r(ax) (defn r)

20 Format for structural induction proof In this class, please use the format of the previous example for proofs by structural induction. Essential elements: Identify the Claim you are proving by structural induction. It should be a claim about all elements of some inductively-defined set. Say it is proof by structural induction, and clearly indicate the inductive definition on which the proof is based. Clearly label basis and induction cases as such. In the induction case, state IH and NTS. Clearly indicate where and how the IH is used.

21 Proving correctness of the insert function (Ex. 12 b. p275) Recall the inductive definition of lists(a): Basis: lists(a). Induction: If x A and L lists(a), then x :: L lists(a). Recall also the following recursive definition of a function from N lists(n) to lists(n) (2.36 page 163): insert(x, ) = x { x :: y :: L, if x y insert(x,y :: L) = y :: insert(x,l), otherwise Claim: For all L lists(n), for all x N, if L is sorted, then insert(x,l) is a sorted permutation of x :: L. We previously discussed the idea for an argument proving this claim. The idea of that argument can be made precise using structural induction on L. Consider any x N. We ll show that, for all L lists(n), if L is sorted, then insert(x,l) is a sorted permutation of x :: L.

22 insert(x, ) = x { x :: y :: L, if x y insert(x,y :: L) = y :: insert(x,l), otherwise We ll show that, for all L lists(n), if L is sorted, then insert(x,l) is a sorted permutation of x :: L (Exercise 12 b. page 275). Proof by structural induction on L. Basis: insert(x, ) = x, which is a sorted permutation of x :: = x. Induction: L lists(n), y N. IH: If L is sorted, then insert(x,l) is a sorted permutation of x :: L. NTS: If y :: L is sorted, then insert(x,y :: L) is a sorted permutation of x :: y :: L. Assume y :: L is sorted. Consider two cases: Case 1: x y. Then insert(x,y :: L) = x :: y :: L. Since y :: L is sorted and x y, x :: y :: L is also sorted. And of course x :: y :: L is a permutation of x :: y :: L.

23 insert(x, ) = x { x :: y :: L, if x y insert(x,y :: L) = y :: insert(x,l), otherwise Case 2: x > y. So insert(x,y :: L) = y :: insert(x,l). Since y :: L is sorted (by assumption), so is L. So by IH we can conclude that insert(x,l) is a sorted permutation of x :: L. It follows easily that y :: insert(x,l) is a permutation of x :: y :: L. And to see that y :: insert(x,l) is sorted, it is enough to check that every element of insert(x,l) is at least y, since we already know that insert(x,l) is sorted. This is easy to check... Notice first that since y :: L is sorted, every element of L is at least y. We also know that x is at least y. So every element of x :: L is at least y, and since insert(x,l) is a permutation of x :: L, we can conclude that every element of insert(x,l) is at least y.

24 Proving correctness of the sort function (Ex. 12 a. p275) Recall the following recursively-defined function, from lists(n) to lists(n): sort( ) = sort(x :: L) = insert(x, sort(l)) Given the previous result for insert, we can prove that for all L lists(n), sort(l) is a sorted permutation of L. By structural induction on (the inductive definition of) L. Basis: sort( ) =, which is a sorted permutation of itself. Induction: L lists(n), x N. IH: sort(l) is a sorted permutation of L. NTS: sort(x :: L) is a sorted permutation of x :: L. Notice that sort(x :: L) = insert(x,sort(l)), and it remains only to show that insert(x,sort(l)) is a sorted permutation of x :: L. By IH, sort(l) is a sorted permutation of L. Since sort(l) is sorted, we know by the result from the previous problem that insert(x, sort(l)) is a sorted permutation of x :: sort(l), and it remains only to observe that x :: sort(l) is in turn a permutation of x :: L, which is true since sort(l) is a permutation of L.

25 Remarks on these last two correctness proofs The previous two problems are similar to Exercise 12, Section 4.4 in the textbook. But the textbook s version of these problems does not give an adequate account of correctness of the sort and insert functions. Let me elaborate... About insert, the textbook asks you to prove that insert(x,l) is sorted if L is. If you try to do that in a straightforward fashion by structural induction on L, you will likely fail. (Or at least you should!) Why? Because at a key point in the proof, you will need to conclude from the assumption (via IH) that insert(x,l) is sorted that y :: insert(x,l) is also sorted. But it doesn t follow that easily. As it turns out, you need to know more about insert(x,l) in particular, you need to know that every element of insert(x,l) is at least y, and although this is indeed the case, it does not follow from the IH. This is one reason why we needed to talk about permutations...

26 Interestingly, the insert function does have the correctness property that the textbook mentions: if L is sorted, then insert(x,l) is sorted. Indeed, this is an immediate consequence of the result we proved above. There we considered the stronger claim that if L is sorted, then insert(x,l) is a sorted permutation of x :: L. This stronger property is better for proof by induction because we get to make use of the correspondingly stronger IH. But the textbook s version of correctness for the insert function is inappropriate for another reason. It is intuitively wrong, because it provides an inadequate characterization of correctness for an insert function. Can you see why?

27 To see the difficulty more starkly, suppose that we define a much simpler version of the function: for all x N and L lists(n), insert(x,l) =. This constant function is intuitively wrong; nonetheless, it has the property that the textbook uses to characterize correctness. That is, it satisfies the claim of Exercise 12 b, that if L is sorted, then so is insert(x, L). By the way, you can see that similarly it would not be sufficient to say that what we require of sort(l) is that it be sorted, for every L lists(n). And yet that is all that is proved in the textbook s solution to Exercise 12 a!

28 A general conclusion to draw from this discussion is that it is difficult to give adequate specifications concerning correctness of functions (or, say, software). It is generally hard to make our requirements sufficiently explicit. (That is not to say that it isn t worth doing!) Another, more technical conclusion is that in proofs by induction, it is often the case that stronger claims are easier to prove (because you get a stronger induction hypothesis).

Mathematical Induction. Lecture 10-11

Mathematical Induction. Lecture 10-11 Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

More information

3. Mathematical Induction

3. Mathematical Induction 3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

More information

C H A P T E R Regular Expressions regular expression

C H A P T E R Regular Expressions regular expression 7 CHAPTER Regular Expressions Most programmers and other power-users of computer systems have used tools that match text patterns. You may have used a Web search engine with a pattern like travel cancun

More information

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

More information

Full and Complete Binary Trees

Full and Complete Binary Trees Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

More information

Sample Induction Proofs

Sample Induction Proofs Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given

More information

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS. Christopher Heil Georgia Institute of Technology WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

More information

Cartesian Products and Relations

Cartesian Products and Relations Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

More information

Reading 13 : Finite State Automata and Regular Expressions

Reading 13 : Finite State Automata and Regular Expressions CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

More information

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

More information

Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

More information

The last three chapters introduced three major proof techniques: direct,

The last three chapters introduced three major proof techniques: direct, CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

More information

This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements. 3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

More information

5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1

5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1 MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing

More information

def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system. Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true

More information

8 Divisibility and prime numbers

8 Divisibility and prime numbers 8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

More information

Solution to Homework 2

Solution to Homework 2 Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if

More information

INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

More information

Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

More information

Section IV.1: Recursive Algorithms and Recursion Trees

Section IV.1: Recursive Algorithms and Recursion Trees Section IV.1: Recursive Algorithms and Recursion Trees Definition IV.1.1: A recursive algorithm is an algorithm that solves a problem by (1) reducing it to an instance of the same problem with smaller

More information

1.6 The Order of Operations

1.6 The Order of Operations 1.6 The Order of Operations Contents: Operations Grouping Symbols The Order of Operations Exponents and Negative Numbers Negative Square Roots Square Root of a Negative Number Order of Operations and Negative

More information

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

More information

SECTION 10-2 Mathematical Induction

SECTION 10-2 Mathematical Induction 73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

More information

Recursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1

Recursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1 Recursion Slides by Christopher M Bourke Instructor: Berthe Y Choueiry Fall 007 Computer Science & Engineering 35 Introduction to Discrete Mathematics Sections 71-7 of Rosen cse35@cseunledu Recursive Algorithms

More information

MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

More information

Mathematical Induction. Mary Barnes Sue Gordon

Mathematical Induction. Mary Barnes Sue Gordon Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

More information

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

More information

15. Symmetric polynomials

15. Symmetric polynomials 15. Symmetric polynomials 15.1 The theorem 15.2 First examples 15.3 A variant: discriminants 1. The theorem Let S n be the group of permutations of {1,, n}, also called the symmetric group on n things.

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice,

More information

15-150 Lecture 11: Tail Recursion; Continuations

15-150 Lecture 11: Tail Recursion; Continuations 15-150 Lecture 11: Tail Recursion; Continuations Lecture by Dan Licata February 21, 2011 In this lecture we will discuss space usage: analyzing the memory it takes your program to run tail calls and tail

More information

Mathematical Induction

Mathematical Induction Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How

More information

Polynomial Invariants

Polynomial Invariants Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

Mathematical Induction

Mathematical Induction Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

More information

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +... 6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)

Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes) NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain

More information

Pigeonhole Principle Solutions

Pigeonhole Principle Solutions Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

More information

Methods for Finding Bases

Methods for Finding Bases Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,

More information

NIM with Cash. Abstract. loses. This game has been well studied. For example, it is known that for NIM(1, 2, 3; n)

NIM with Cash. Abstract. loses. This game has been well studied. For example, it is known that for NIM(1, 2, 3; n) NIM with Cash William Gasarch Univ. of MD at College Park John Purtilo Univ. of MD at College Park Abstract NIM(a 1,..., a k ; n) is a -player game where initially there are n stones on the board and the

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that

More information

Linear and quadratic Taylor polynomials for functions of several variables.

Linear and quadratic Taylor polynomials for functions of several variables. ams/econ 11b supplementary notes ucsc Linear quadratic Taylor polynomials for functions of several variables. c 010, Yonatan Katznelson Finding the extreme (minimum or maximum) values of a function, is

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem The Chinese Remainder Theorem Evan Chen evanchen@mit.edu February 3, 2015 The Chinese Remainder Theorem is a theorem only in that it is useful and requires proof. When you ask a capable 15-year-old why

More information

Lecture 1: Course overview, circuits, and formulas

Lecture 1: Course overview, circuits, and formulas Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik

More information

6.3 Conditional Probability and Independence

6.3 Conditional Probability and Independence 222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

More information

Objective. Materials. TI-73 Calculator

Objective. Materials. TI-73 Calculator 0. Objective To explore subtraction of integers using a number line. Activity 2 To develop strategies for subtracting integers. Materials TI-73 Calculator Integer Subtraction What s the Difference? Teacher

More information

Automata and Computability. Solutions to Exercises

Automata and Computability. Solutions to Exercises Automata and Computability Solutions to Exercises Fall 25 Alexis Maciel Department of Computer Science Clarkson University Copyright c 25 Alexis Maciel ii Contents Preface vii Introduction 2 Finite Automata

More information

DIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents

DIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents DIFFERENTIABILITY OF COMPLEX FUNCTIONS Contents 1. Limit definition of a derivative 1 2. Holomorphic functions, the Cauchy-Riemann equations 3 3. Differentiability of real functions 5 4. A sufficient condition

More information

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

More information

Binary Multiplication

Binary Multiplication Binary Multiplication Q: How do we multiply two numbers? eg. 12, 345 6, 789 111105 987600 8641500 + 74070000 83, 810, 205 10111 10101 10111 00000 1011100 0000000 + 101110000 111100011 Pad, multiply and

More information

Regular Languages and Finite Automata

Regular Languages and Finite Automata Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a

More information

Data Structures Fibonacci Heaps, Amortized Analysis

Data Structures Fibonacci Heaps, Amortized Analysis Chapter 4 Data Structures Fibonacci Heaps, Amortized Analysis Algorithm Theory WS 2012/13 Fabian Kuhn Fibonacci Heaps Lacy merge variant of binomial heaps: Do not merge trees as long as possible Structure:

More information

Thinking of a (block) cipher as a permutation (depending on the key) on strings of a certain size, we would not want such a permutation to have many

Thinking of a (block) cipher as a permutation (depending on the key) on strings of a certain size, we would not want such a permutation to have many Fixed points of permutations Let f : S S be a permutation of a set S. An element s S is a fixed point of f if f(s) = s. That is, the fixed points of a permutation are the points not moved by the permutation.

More information

Fundamentele Informatica II

Fundamentele Informatica II Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear

More information

Normal distribution. ) 2 /2σ. 2π σ

Normal distribution. ) 2 /2σ. 2π σ Normal distribution The normal distribution is the most widely known and used of all distributions. Because the normal distribution approximates many natural phenomena so well, it has developed into a

More information

Basic Proof Techniques

Basic Proof Techniques Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

More information

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors. The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

More information

Regular Expressions and Automata using Haskell

Regular Expressions and Automata using Haskell Regular Expressions and Automata using Haskell Simon Thompson Computing Laboratory University of Kent at Canterbury January 2000 Contents 1 Introduction 2 2 Regular Expressions 2 3 Matching regular expressions

More information

Lecture 16 : Relations and Functions DRAFT

Lecture 16 : Relations and Functions DRAFT CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

More information

Vieta s Formulas and the Identity Theorem

Vieta s Formulas and the Identity Theorem Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion

More information

CONTENTS 1. Peter Kahn. Spring 2007

CONTENTS 1. Peter Kahn. Spring 2007 CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................

More information

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

More information

TAKE-AWAY GAMES. ALLEN J. SCHWENK California Institute of Technology, Pasadena, California INTRODUCTION

TAKE-AWAY GAMES. ALLEN J. SCHWENK California Institute of Technology, Pasadena, California INTRODUCTION TAKE-AWAY GAMES ALLEN J. SCHWENK California Institute of Technology, Pasadena, California L INTRODUCTION Several games of Tf take-away?f have become popular. The purpose of this paper is to determine the

More information

LEARNING OBJECTIVES FOR THIS CHAPTER

LEARNING OBJECTIVES FOR THIS CHAPTER CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

More information

Philosophical argument

Philosophical argument Michael Lacewing Philosophical argument At the heart of philosophy is philosophical argument. Arguments are different from assertions. Assertions are simply stated; arguments always involve giving reasons.

More information

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers. MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

More information

Homework until Test #2

Homework until Test #2 MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

More information

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

More information

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

More information

1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal:

1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: Exercises 1 - number representations Questions 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: (a) 3012 (b) - 435 2. For each of

More information

AN ANALYSIS OF A WAR-LIKE CARD GAME. Introduction

AN ANALYSIS OF A WAR-LIKE CARD GAME. Introduction AN ANALYSIS OF A WAR-LIKE CARD GAME BORIS ALEXEEV AND JACOB TSIMERMAN Abstract. In his book Mathematical Mind-Benders, Peter Winkler poses the following open problem, originally due to the first author:

More information

7: The CRR Market Model

7: The CRR Market Model Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney MATH3075/3975 Financial Mathematics Semester 2, 2015 Outline We will examine the following issues: 1 The Cox-Ross-Rubinstein

More information

Introduction. Appendix D Mathematical Induction D1

Introduction. Appendix D Mathematical Induction D1 Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

More information

THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

MATH 22. THE FUNDAMENTAL THEOREM of ARITHMETIC. Lecture R: 10/30/2003

MATH 22. THE FUNDAMENTAL THEOREM of ARITHMETIC. Lecture R: 10/30/2003 MATH 22 Lecture R: 10/30/2003 THE FUNDAMENTAL THEOREM of ARITHMETIC You must remember this, A kiss is still a kiss, A sigh is just a sigh; The fundamental things apply, As time goes by. Herman Hupfeld

More information

DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH

DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH CHRISTOPHER RH HANUSA AND THOMAS ZASLAVSKY Abstract We investigate the least common multiple of all subdeterminants,

More information

Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.

Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S. Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a

More information

Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

More information

6.2 Permutations continued

6.2 Permutations continued 6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

More information

Permutation Groups. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003

Permutation Groups. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003 Permutation Groups Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003 Abstract This paper describes permutations (rearrangements of objects): how to combine them, and how

More information

Lecture 5 - CPA security, Pseudorandom functions

Lecture 5 - CPA security, Pseudorandom functions Lecture 5 - CPA security, Pseudorandom functions Boaz Barak October 2, 2007 Reading Pages 82 93 and 221 225 of KL (sections 3.5, 3.6.1, 3.6.2 and 6.5). See also Goldreich (Vol I) for proof of PRF construction.

More information

Session 6 Number Theory

Session 6 Number Theory Key Terms in This Session Session 6 Number Theory Previously Introduced counting numbers factor factor tree prime number New in This Session composite number greatest common factor least common multiple

More information

The Determinant: a Means to Calculate Volume

The Determinant: a Means to Calculate Volume The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are

More information

T ( a i x i ) = a i T (x i ).

T ( a i x i ) = a i T (x i ). Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

More information

Lecture 1: Schur s Unitary Triangularization Theorem

Lecture 1: Schur s Unitary Triangularization Theorem Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections

More information

COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012

COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012 Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about

More information

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

Data Structures and Algorithms Written Examination

Data Structures and Algorithms Written Examination Data Structures and Algorithms Written Examination 22 February 2013 FIRST NAME STUDENT NUMBER LAST NAME SIGNATURE Instructions for students: Write First Name, Last Name, Student Number and Signature where

More information

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12 CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

More information

Real Roots of Univariate Polynomials with Real Coefficients

Real Roots of Univariate Polynomials with Real Coefficients Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials

More information

MATH 10034 Fundamental Mathematics IV

MATH 10034 Fundamental Mathematics IV MATH 0034 Fundamental Mathematics IV http://www.math.kent.edu/ebooks/0034/funmath4.pdf Department of Mathematical Sciences Kent State University January 2, 2009 ii Contents To the Instructor v Polynomials.

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

More information

Base Conversion written by Cathy Saxton

Base Conversion written by Cathy Saxton Base Conversion written by Cathy Saxton 1. Base 10 In base 10, the digits, from right to left, specify the 1 s, 10 s, 100 s, 1000 s, etc. These are powers of 10 (10 x ): 10 0 = 1, 10 1 = 10, 10 2 = 100,

More information

Linear Programming Notes VII Sensitivity Analysis

Linear Programming Notes VII Sensitivity Analysis Linear Programming Notes VII Sensitivity Analysis 1 Introduction When you use a mathematical model to describe reality you must make approximations. The world is more complicated than the kinds of optimization

More information

11 Multivariate Polynomials

11 Multivariate Polynomials CS 487: Intro. to Symbolic Computation Winter 2009: M. Giesbrecht Script 11 Page 1 (These lecture notes were prepared and presented by Dan Roche.) 11 Multivariate Polynomials References: MC: Section 16.6

More information

CAs and Turing Machines. The Basis for Universal Computation

CAs and Turing Machines. The Basis for Universal Computation CAs and Turing Machines The Basis for Universal Computation What We Mean By Universal When we claim universal computation we mean that the CA is capable of calculating anything that could possibly be calculated*.

More information