CS243, Logic and Computation Recursion and Induction
|
|
- Edmund Ramsey
- 7 years ago
- Views:
Transcription
1 CS243, Prof. Alvarez 1 DEFINITION BY RECURSION Prof. Sergio A. Alvarez alvarez/ Maloney Hall, room 569 alvarez@cs.bc.edu Computer Science Department voice: (617) Boston College fax: (617) Chestnut Hill, MA USA CS243, Logic and Computation Recursion and Induction You may be familiar with recursion as a programming technique that uses self-reference, as in Algorithm 1. This technique can yield elegant and concise code. Algorithm 1: Input: integer n 1 Output: an integer value determined by the value of n f(n) (1) if n == 1 (2) return 1 (3) else (4) return 2n 1+f(n 1) We will be interested in constructing airtight arguments about such recursive definitions. The fundamental technique for doing so is mathematical induction. Recursion can also be used to define objects more general than functions on integers, and induction will often be the tool of choice for proving statements about such recursively defined objects. 1 Definition by Recursion A recursive definition specifies the elements of a set S in two parts: 1. A basis or base case that defines the simplest objects in S. 2. A recursive step that defines how objects in S can be individually modified, or combined, to produce more complex objects in S. A third part of a recursive definition, closure, is not always stated explicitly: S is taken to consist of all objects that are either defined in the basis, or that can be constructed from basis objects by a finite number of applications of the recursive step. Another way of stating this part is that S is the smallest set that is consistent with the basis and recursive steps. Examples of recursive definitions Recursion on integers. Algorithm 1 provides a first example of definition by recursion. This is a classical example of recursion on the set of positive integers. The basis of the
2 1 DEFINITION BY RECURSION definition involves the argument value n = 1, and states that F (1) has (returns) the value 1. The recursive case of the definition considers the step from n 1 to n, and states that F (n) is obtained by adding 2n 1 to F (n 1). The reference to a set S in the formal version of definition by recursion may seem inapplicable at first. However, that is just a formality: you can think of the function F from Algorithm 1 as corresponding to the set S of all pairs (n, F (n)), where n is a positive integer. Another example of recursion on integers is exponentiation, that is, raising a base b to an integer power p. This can be done efficiently using recursion in the exponent, by noting that halving the exponent (in integer arithmetic) produces the square root of the desired answer in the case of an even exponent, and misses precisely one copy of the base in the case of an odd exponent: (Basis) b 0 = 1, b 1 = b (Recursive step) if p > 1, then b p = ( b p/2 ) 2 b p mod 2 The Python code below implements the above approach. >>> def power(base, exp):... if exp==0:... return 1... if exp==1:... return base... halfway = power(base, exp/2)... return power(base, exp%2) * halfway**2 Structural recursion. An example of a different type is the following simplified definition of arithmetic expression, which can be used as part of the specification of a programming language such as Python. The definition is simplified in that only addition and multiplication are allowed as arithmetic operators. In contrast with the example of Algorithm 1, this definition of arithmetic expressions involves recursion in the syntactical structure of the expressions, rather than the set of positive integers. Definition 1.1. The set of additive/multiplicative arithmetic expressions is defined as follows. Note that parentheses are a required syntactical element in all but the simplest expressions. 1. A number constant (e.g., 25 or ) is an arithmetic expression. 2. If E and F are arithmetic expressions, then so are (E + F ), and (E F ). The set S referred to in the general description of definition by recursion is again implicit here: S is just the set of all arithmetic expressions of the given type.
3 1 DEFINITION BY RECURSION Parse trees. You can think of the above definition as being associated with a tree structure for each valid arithmetic expression: the basis constructs the leaves of the tree, and the recursive case constructs a larger tree as a root node corresponding to an arithmetic operator and four child nodes corresponding to the two outer parentheses and two simpler arithmetic expressions that form the operands. For example, the expression (25 (7 + 10)) has the following parse tree: * ( 25 + ) ( 7 10 ) The abbreviated form of the tree, omitting the parentheses, would be the following: * Example 1.1. How to write a Python program that will detect if a string has the form illustrated in the examples below? (*) (*(*)) (*(*(*)))... We do this by capturing the key string pattern as a definition by recursion: (Basis) The empty string has the target form (Recursion) If a string s has the target form, then so does the string (*s) It is now an easy matter to translate this recursive definition into a Python function: >>> def hastargetform(s):... if len(s)==0:... return True... return s[0]== ( and s[1]== * and s[-1]== ) and hastargetform(s[2:-1])
4 2 Proof by Induction 2 PROOF BY INDUCTION Induction in the present context refers to a technique for proving statements about collections of objects defined by recursion. There may be some property of a newly defined collection of objects that we are interested in proving (like a specific simplified expression for a recursively defined function, or some structural property of a recursively defined tree). Visualize individual objects as dominos standing on edge. Proving the property about a particular object can be visualized as toppling the corresponding domino. Intuitively, a recursive definition lines up the dominos very nicely: the first domino or two are defined by the basis, and the recursive step takes care of connecting consecutive dominos. If the first domino falls over, then the second will follow, then the third, and so on. Assuming that a chain reaction is correctly supported by the setup, all of the dominos will eventually topple. 2.1 Ways of messing up a domino chain How could the above chain reaction possibly not work? Either one of the following would prevent a full chain topple. 1. The first domino doesn t topple. 2. Some pair of consecutive dominos is not correctly set up, so that the earlier of the two can topple without the later one toppling. Addressing both of the above potential concerns will lead to the happy outcome in which all of the dominos topple. 1 This is important enough that we will state it more formally. Using a formal model has the advantages of clarity and specificity about assumptions. A general formal description of proof by induction is given below. 2.2 Principle of proof by induction Theorem 2.1. Principle of proof by induction. Suppose that S is a set of objects defined by recursion, and that P is a property of objects such that: 1. All objects of S defined in the basis of the recursion have property P. 2. Whenever objects in S that are known to have property P are combined as specified in the recursive case of the definition of S, the resulting objects also have property P. Then all objects in S have property P. 2 1 There is actually a third way of messing up the chain, but it is devious enough to postpone discussion. 2 This relies on subtleties in the notion of definition by recursion. See comments at the end of these notes.
5 2.3 Examples of reasoning using mathematical induction 2 PROOF BY INDUCTION As a matter of terminology, 1 is known as the induction basis (or simply basis), and 2 is known as the inductive step. The antecedent condition in the inductive step, namely that the objects to be combined have the target property, P, is called the induction hypothesis. Thus, the inductive step involves verifying that, if the induction hypothesis holds for a set of objects, it also holds for the result of combining those objects as described in the recursive case of the definition. The term induction refers to the specific-to-general reasoning that is carried out here: the set of objects that satisfy the target property is expanded to contain the additional objects constructed in the recursive step of the definition. 2.3 Examples of reasoning using mathematical induction Induction on integers As a first example, consider the code in Algorithm 1. Can you find a concise expression for the function computed in this case? What if you want to be sure that things work as you believe? We propose modeling the situation in terms of a recursively defined set to which the principle of proof by induction will apply. Here goes. Notice that we seek an expression that will be valid for all positive integers, n. Thus, it is natural to think of this problem as requiring proving that all positive integers satisfy a certain propoerty. To begin, you must state what you hope to be true for a given n. In the case of Algorithm 1, one sees that F (1) = 1, F (2) = 4, and F (3) = 9. With these examples in hand, a reasonable target property would be the following. The target property of an unspecified positive integer, n. F (n) equals n 2. We now use mathematical induction to verify that this educated guess is actually correct for all positive integers, n. In order to prove that the target property holds for all positive integers, we verify the assumptions of the principle of proof by induction in this particular context. This requires making explicit the choice of the set of positive integers as the recursively defined set, S, in the general principle of proof by induction. We will also explicitly provide a recursive definition for this set, below. Recursive definition of the set of positive integers. (basis) 1 is a positive integer. (recursive step) if n is a positive integer, then n + 1 is a positive integer. (closure) the set of positive integers is the set of all numbers that can be obtained from 1 by a finite number of applications of the recursive step (that is, by adding 1 a finite (zero, one, or more) number of times). This may seem like a silly definition. However, it lays bare the most fundamental assumptions about the nature of the counting numbers: there is a first one, and there is a next one after each one. This establishes the soundness of the domino chain reaction metaphor.
6 2.3 Examples of reasoning using mathematical induction 2 PROOF BY INDUCTION Proof by induction of the target property for all positive integers. By the principle of proof by induction, any induction proof must be patterned after the recursive definition of the underlying set S, which is the set of positive integers in the current example. The only base case therefore involves the value n = 1, and the recursive case considers the step from n to n + 1. (basis) Claim: F (n) equals n 2 for all n considered in the basis of the recursive definition of F. The only values of n to consider in this case is n = 1. Determining if 1 belongs has the target property requires verifying that the value F (1) is 1 2, that is, 1. That s precisely what it is (see Algorithm 1). Done. Claim: if a positive integer satisfies the target property, then so do all corresponding values considered in the recursive case of the definition of F. Because of the manner in which Algorithm 1 is written, the recursive step involves the transition between argument values n 1 and n, where n is a positive integer other than 1. We assume (induction hypothesis) that the value n 1 satisfies the target property, meaning that F (n 1) equals (n 1) 2 for that particular n. Now we must determine if the value n resulting from the recursive step of the definition also satisfies the target property. We see by the algorithm that F (n) returns the sum 2n 1+F (n 1). However, we know by the induction hypothesis that F (n 1) equals (n 1) 2, and the recursive definition just tacks on the extra 2n 1 term, so we conclude that F (n) equals 2n 1+(n 1) 2. This simplifies to n 2. This shows that n satisfies the target property, so we ve completed the inductive step. Having verified that the two requisite properties hold, we conclude by the principle of proof by induction that all positive integers satisfy the target property. In other words, it is true for all positive integers n that F (n) returns n 2. Case closed Structural induction on arithmetic expressions We now give a simple example of proof by induction in the case of a definition by structural recursion, namely Def We consider a quick way of checking for errors in an arithmetic expression. It is intuitively clear that an error-free expression should have the target property below. However, we will need to verify that our formal definition in section 1 actually passes this smell test. The target property of an unspecified expression, E. E has the same number of left and right parentheses. 1. Claim: Any arithmetic expression defined in the base case has the same number of left and right parentheses. This is obvious, as the basis expressions are just numbers without any parentheses at all.
7 2.3 Examples of reasoning using mathematical induction 2 PROOF BY INDUCTION 2. Claim: if E and F are arithmetic expressions, which has the same number of left and right parentheses (nothing is stated about how the parenthesis counts compare across the two expressions), then each of the expressions E +F and E F has the same number of left and right parentheses (again, only counts within a given expression are considered). We now prove this claim. Each of the expressions (E + F ) and (E F ) have as many left parentheses as E and F combined plus one, and as many right parentheses as E and F combined plus one. Thus, these two expressions defined in the recursive step retain a balance between left and right parentheses, assuming (induction hypothesis) that each of E and F possess that balance Structural induction in formal languages Consider the context-free grammar G that has the rules below. The start symbol is S, other variables are A and B, and the three lowercase letters a, b, c are terminal symbols. S AB A aacc ɛ B cbbb ɛ Strings derivable in G include ɛ, acc, cbb, and aacccccbb. We would like to prove assertions about the set of derivable strings. Does induction apply? The answer is yes. In order for induction to be applicable, we must first identify an underlying recursively defined set such that whatever target assertion we wish to prove describes a property that all objects of that set presumably have. The idea is that the rules of G do, in fact, constitute a recursive definition of a set of strings. What set is that? We ll discuss this below. Derivations in the above grammar G. Any derivation according to the rules of G will proceed as follows: Start wth the single variable S. At the first stage of the derivation, there is no choice but to apply the rule S AB, yielding the derived string of variables AB. At each subsequent stage of the derivation, a certain string w of terminals and/or variables will have been derived so far. Application of the rules in the bottom two lines of the description of G will allow the derivation to continue, producing other strings of terminals and/or variables, in the following way. If w matches the pattern on the left-hand side of one of the rules of G in the bottom two lines of the grammar description, then that rule may be applied to continue the derivation. More specifically in the present case: if w has an A in it somewhere, in other words, if w is of the form xay for some prefix string x and some suffix string y, then it is allowable to derive the string xaaccy from w, simply by substituting aacc for the particular occurrence of A that has been singled out for the particular x and y being considered (there could be several distinct occurrences of A within w). The other rules yield additional possibilities. Taken together, all of this produces a definition by recursion of
8 2.3 Examples of reasoning using mathematical induction 2 PROOF BY INDUCTION the set of strings of terminals and/or variables that can occur during a valid derivation in the grammar G. It is this latter set that we can define by recursion via the grammatical rules of G. Recursive definition of the set of strings derivable in the grammar G. Here s some notation to make the going a little easier. Notice that the strings of terminals and/or variables are just elements of the Kleene closure {S, A, B, a, b, c}. We ll write S w when we mean that w can be derived from the start symbol S by a finite number of applications (zero, one, or more) of the rules of G, starting from S. The set that we will define by recursion is therefore the following: deriv(g) = {w {S, A, B, a, b, c} S w} With suitable notation in place, here s the actual recursive definition of deriv(g): (basis) S deriv(g) and AB deriv(g). This accounts for the start symbol and the result of the first unavoidable rule application in any derivation with at least one step in it. (recursive steps) if xay deriv(g), where x and y are strings of terminals and/or variables, then xaaccy deriv(g) and xy deriv(g). This accounts for the two rules that have A on the left-hand side. if xby deriv(g), where x and y are strings of terminals and/or variables, then xcabby deriv(g) and xy deriv(g). This accounts for the two rules that have B on the left-hand side. (closure property) deriv(g) is the set of all objects that are obtained by a finite number (zero, one, or more) of applications of the recursive steps above, starting from the objects defined in the basis. Example of an induction proof for strings derivable in the grammar G. One may be interested in proving some general assertion about the strings that can be derived in G. Given that the set that is naturally defined recursively by G consists of strings that may include variables in addition to terminals, induction requires extending the target assertion to one that applies to all such more general strings in deriv(g). Here are some examples of possible target assertions of that type: If w deriv(g), then any occurences of a in w precede any occurrences of b in w, and any occurrences of b in w precede any occurrences of c in w. If w deriv(g), then the number of terminal symbols in w is divisible by 3.
9 3 SUBTLETIES Let s prove the second of the above assertions by induction. As always, the induction proof must be patterned after the recursive definition of the set of the objects to which the target assertion applies. In the present context, that set is deriv(g). Here goes: (basis) Show that the number of terminals in S is divisible by 3 and that the number of terminals in AB is divisible by 3. This is true, because there are 0 terminals in each of these, and 0 is divisible by 3. Done. (recursive steps) Suppose that xay deriv(g) has a number of terminals that is divisible by 3. Show that xaaccy and xy each have a number of terminals that is divisible by 3. This is easy, because the first of these adds precisely 3 terminals, and the second doesn t add any. In both cases, you again end up with a number divisible by 3. Suppose that xby deriv(g), has a number of terminals that is divisible by 3. Show that xcabby and xy each have a number of terminals that is divisible by 3. Again, each of these rules changes the number of terminals by a multiple of 3, so divisibility by 3 of the number of terminals is not affected. Done. That completes the proof. By the principle of proof by induction, we conclude that all strrings in deriv(g) have a number of terminals that is divisible by 3. 3 Subtleties 3.1 Induction proof that all upper dyadic numbers are red Definition of upper dyadic number Consider the universe of all real numbers greater than 1 that differ from the next integer up by an amount of the form 1/2 n for some positive integer, n. Call such numbers upper dyadic. For example, 1.5 qualifies (n = 1), as does 6.75 (n = 2), but 1.25 does not, and neither does 5 1/3. Notice that 1.5 is the smallest upper dyadic number and that the next such number is (x + x )/2, where x is the smallest integer greater than or equal to x. 3 Redness of upper dyadic numbers We define the notion of redness for upper dyadic numbers by recursion, as follows: is red. 2. if x is a red upper dyadic number, then so is (x + x )/2. For example, since 1.5 is red, so are 1.75, 1.875, , and so on. The above two facts give us a basis and inductive step for a proof by induction. We conclude that all upper dyadic numbers are red. 3 You should not blindly accept such claims prove them.
10 4 EXERCISES Comments The argument works well in many cases. For example, we can verify the redness of by consdering the chain 1.5, 1.75, 1.875, (basis, plus three applications of the recursive step). However, what about the upper dyadic number 2.5? One realizes that this number (and many others) have no immediate predecessor in the natural ordering associated with the recursive step. That is to say, there is no upper dyadic number x such that (x + x )/2 equals 2.5. It is easy to see that x = 2 would be the only solution, but 2 is not upper dyadic. In fact, it would be impossible to prove that 2.5 is red, since it may well not be and there would be no contradiction of known facts. This is where the easily overlooked closure property in definition by recursion comes in: induction only extends to the closure of the basis elements, defined as the set of all objects that can be constructed from the basis objects in a finite number of applications of the recursive rules. In the present context, the closure will include only the upper dyadic numbers that are less than 2. All such numbers can be proved to be red by induction. Proof of Theorem 2.1. Suppose that S satisfies the assumptions of Theorem 2.1, and let x be any element of S. Since S is assumed to be defined by recursion, this element x must either be one of the objects added to S in the basis of the recursive definition, or else must be an element that can be obtained from known elements of S by a finite number of applications of the recursive step in the definition. If x is a basis element of S, the theorem s assumption 1 that all basis elements have property P shows that x in particular has property P. If, on the other hand, x is not a basis element, then x must be obtainable from basis elements of S by a finite number of recursive step applications. Each such step along the way from these basis elements to x will preserve property P, by assumption 2. Hence, x must have property P also. This proves that x has property P in all cases. Since this argument applies to any element of S, we conclude that all elements of S have property P, as stated. 4 Exercises 1. Give a clear definition by recursion for each of the sets described below. Explain. (a) The set of all positive even integers. (b) The set of all polynomials in a single variable, x. Note: we ll agree that the basis should only define a finite number of different polynomials. 2. For each of the following quantities, discover and state a simple algebraic expression with value equal to the given quantity, and give a proof by induction that the original quantity and your simplified expression are indeed equal for all values of n. (a) n (b) The number of parentheses in the expression E n, where E 1 is the single digit 1, and E n for any n > 1 is the parenthesized expression (E n 1 + E n 1 ).
11 4 EXERCISES (c) ( 1) n 1 n 3. Prove the following rule for the number of elements in a Cartesian product by induction: S 1 S k = S 1 S k Notice that the symbol denotes Cartesian product on the left and integer product on the right. 4. Define two functions on non-negative integers, n, as follows: { { 1, if n = 0 1, if n = 0 f(n) = g(n) = 2g(n 1), if n > 0 f(n 1) + 3, if n > 0 Find a simple expression for g(2n), valid for all non-negative integers n, and prove it by induction carefully. 5. It is often stated that exponential growth is faster than polynomial growth. In this task, you will prove the following specific version of this statement in detail: There is an integer n 0 such that 2 n is larger than n 2 for all integers n n 0. Prove this statement by induction. Find the smallest value of n 0 that works. 6. Prove the claim made in section 3.1 that the upper dyadic number immediately above x is (x + x )/2.
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 informationFull 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 information3. 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 informationSECTION 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 information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationDiscrete 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 information1.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 informationC 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 informationReading 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 information8 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 informationRegular 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 informationWRITING 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 informationMathematical 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 information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More informationAutomata and Formal Languages
Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,
More informationChapter 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 information5.1 Radical Notation and Rational Exponents
Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots
More informationBasic 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 information0.8 Rational Expressions and Equations
96 Prerequisites 0.8 Rational Expressions and Equations We now turn our attention to rational expressions - that is, algebraic fractions - and equations which contain them. The reader is encouraged to
More informationMathematical 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 informationCONTENTS 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 informationThe 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 informationThe 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 informationVieta 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 information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationContinued 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 informationCartesian 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 informationMATH10040 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 informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More information6.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 informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More informationThis 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 informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationSection 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 informationMathematical 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 informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationSolving Rational Equations
Lesson M Lesson : Student Outcomes Students solve rational equations, monitoring for the creation of extraneous solutions. Lesson Notes In the preceding lessons, students learned to add, subtract, multiply,
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More information23. RATIONAL EXPONENTS
23. RATIONAL EXPONENTS renaming radicals rational numbers writing radicals with rational exponents When serious work needs to be done with radicals, they are usually changed to a name that uses exponents,
More informationArkansas 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 informationAnswer Key for California State Standards: Algebra I
Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.
More informationChapter 11 Number Theory
Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications
More informationReal 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 informationSection 1.5 Exponents, Square Roots, and the Order of Operations
Section 1.5 Exponents, Square Roots, and the Order of Operations Objectives In this section, you will learn to: To successfully complete this section, you need to understand: Identify perfect squares.
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More informationThe 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 informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
More informationMATH10212 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 informationCHAPTER 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 informationCatalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.
7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationdef: 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 informationMath Workshop October 2010 Fractions and Repeating Decimals
Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,
More informationIndiana State Core Curriculum Standards updated 2009 Algebra I
Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and
More informationLecture 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 informationLEARNING 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 informationRegular Expressions with Nested Levels of Back Referencing Form a Hierarchy
Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy Kim S. Larsen Odense University Abstract For many years, regular expressions with back referencing have been used in a variety
More informationStudent 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 informationIf A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?
Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question
More informationMath 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 informationAutomata 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 information3 Some Integer Functions
3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple
More informationExponents and Radicals
Exponents and Radicals (a + b) 10 Exponents are a very important part of algebra. An exponent is just a convenient way of writing repeated multiplications of the same number. Radicals involve the use of
More informationClick on the links below to jump directly to the relevant section
Click on the links below to jump directly to the relevant section What is algebra? Operations with algebraic terms Mathematical properties of real numbers Order of operations What is Algebra? Algebra is
More informationCMPSCI 250: Introduction to Computation. Lecture #19: Regular Expressions and Their Languages David Mix Barrington 11 April 2013
CMPSCI 250: Introduction to Computation Lecture #19: Regular Expressions and Their Languages David Mix Barrington 11 April 2013 Regular Expressions and Their Languages Alphabets, Strings and Languages
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationSYMBOL AND MEANING IN MATHEMATICS
,,. SYMBOL AND MEANING IN MATHEMATICS ALICE M. DEAN Mathematics and Computer Science Department Skidmore College May 26,1995 There is perhaps no other field of study that uses symbols as plentifully and
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding
More informationProperties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
More informationLecture Notes on Polynomials
Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex
More informationMathematical 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 informationMBA Jump Start Program
MBA Jump Start Program Module 2: Mathematics Thomas Gilbert Mathematics Module Online Appendix: Basic Mathematical Concepts 2 1 The Number Spectrum Generally we depict numbers increasing from left to right
More informationLecture 2: Regular Languages [Fa 14]
Caveat lector: This is the first edition of this lecture note. Please send bug reports and suggestions to jeffe@illinois.edu. But the Lord came down to see the city and the tower the people were building.
More informationWelcome to Math 19500 Video Lessons. Stanley Ocken. Department of Mathematics The City College of New York Fall 2013
Welcome to Math 19500 Video Lessons Prof. Department of Mathematics The City College of New York Fall 2013 An important feature of the following Beamer slide presentations is that you, the reader, move
More informationMath Review. for the Quantitative Reasoning Measure of the GRE revised General Test
Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important
More information16. Recursion. COMP 110 Prasun Dewan 1. Developing a Recursive Solution
16. Recursion COMP 110 Prasun Dewan 1 Loops are one mechanism for making a program execute a statement a variable number of times. Recursion offers an alternative mechanism, considered by many to be more
More information1.2. Successive Differences
1. An Application of Inductive Reasoning: Number Patterns In the previous section we introduced inductive reasoning, and we showed how it can be applied in predicting what comes next in a list of numbers
More informationCOMP 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 informationHow To Understand The Laws Of Algebra
Welcome to Math 19500 Video Lessons Prof. Department of Mathematics The City College of New York Fall 2013 An important feature of the following Beamer slide presentations is that you, the reader, move
More informationIntroduction. 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 informationLAKE ELSINORE UNIFIED SCHOOL DISTRICT
LAKE ELSINORE UNIFIED SCHOOL DISTRICT Title: PLATO Algebra 1-Semester 2 Grade Level: 10-12 Department: Mathematics Credit: 5 Prerequisite: Letter grade of F and/or N/C in Algebra 1, Semester 2 Course Description:
More informationMath 223 Abstract Algebra Lecture Notes
Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course
More informationCreating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities
Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned
More information6.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 informationThe finite field with 2 elements The simplest finite field is
The finite field with 2 elements The simplest finite field is GF (2) = F 2 = {0, 1} = Z/2 It has addition and multiplication + and defined to be 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 0 0 = 0 0 1 = 0
More informationThe Factor Theorem and a corollary of the Fundamental Theorem of Algebra
Math 421 Fall 2010 The Factor Theorem and a corollary of the Fundamental Theorem of Algebra 27 August 2010 Copyright 2006 2010 by Murray Eisenberg. All rights reserved. Prerequisites Mathematica Aside
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More informationTo define function and introduce operations on the set of functions. To investigate which of the field properties hold in the set of functions
Chapter 7 Functions This unit defines and investigates functions as algebraic objects. First, we define functions and discuss various means of representing them. Then we introduce operations on functions
More informationSummation Algebra. x i
2 Summation Algebra In the next 3 chapters, we deal with the very basic results in summation algebra, descriptive statistics, and matrix algebra that are prerequisites for the study of SEM theory. You
More informationThis is a square root. The number under the radical is 9. (An asterisk * means multiply.)
Page of Review of Radical Expressions and Equations Skills involving radicals can be divided into the following groups: Evaluate square roots or higher order roots. Simplify radical expressions. Rationalize
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More informationThis unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.
Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course
More informationMATHEMATICAL 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 informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More information