3.3 Proofs Involving Quantifiers

Size: px
Start display at page:

Download "3.3 Proofs Involving Quantifiers"

Transcription

1 3.3 Proofs Involving Quantifiers 1. In exercise 6 of Section 2.2 you use logical equivalences to show that x(p (x) Q(x)) is equivalent to xp (x) xq(x). Now use the methods of this section to prove that if x(p (x) Q(x)) is true, then xp (x) xq(x) is true. (Note: The other direction of the equivalence is quite a bit harder to prove. See exercise 12 of Section 3.5.) Proof. Suppose x(p (x) Q(x)). Suppose xp (x). Since x(p (x) Q(x)) there exists some object x 0 such that P (x) Q(x) is true. In other words, P (x 0 ) Q(x 0 ). In order for this statement to be true, one of the following conditions must be met: P (x 0 ) and Q(x 0 ) are true, P (x 0 ) is false and Q(x 0 ) is true, or P (x 0 ) and Q(x 0 ) are false. But then, since xp (x), P (x 0 ) is true. Then it follows that Q(x 0 ) is true. Therefore, we have shown xp (x) xq(x). 2. Prove that if A and B\C are disjoint, then A B C. Proof. Suppose A and B\C are disjoint, and suppose x A B. Then since A and B\C are disjoint, if x A, then x / B\C. By the definition of /, x / B\C is equivalent to x B\C. By the definition of \, this is equivalent to ((x B) (x / C)). By DeMorgan s law, this is equivalent to (x B) (x / C). By the definition of, this is equivalent to x / B x C. By the conditional law, this is equivalent to x B x C. 1

2 Therefore, since x B x C and x A B, x C. Since x was an arbitrary element of A, we can conclude that A B C. 3. Suppose A P(A). Prove that P(A) P(P(A)). Proof. Suppose A P(A). Let x be an arbitrary element of A. Then since A P(A) and x A, x P(A). Then there exists y such that y(y x y A). Since y A and A P(A), y P(A). Thus, since x P(A) and y P(A), it follows that x P(P(A)). Therefore, we have just shown P(A) P(P(A)) as required. 4. The hypothesis of the theorem proven in exercise 3 is A P(A). (a) Can you think of a set A for which this hypothesis is true? Definition Suppose A is a set. The power set of A, denoted P(A), is the set whose elements are all the subsets of A. In otherwords, P(A) = {x x A}. Therefore, if A has an element, since A is a subset of itself, the hypothesis is true. If A is an empty set, since the empty set is a subset of every set, the hypothesis is true. Therefore, any set will do (such as R, Q, Z...). 2

3 (b) Can you think of another? There are countless examples of sets where the hypothesis is true. 5. Suppose x is a real number. (a) Prove that if x 1 then there is a real number y such that y+1 y 2 = x. Proof. Let x be an arbitrary real number, and suppose x 1. Let y = 2x + 1 x 1 which is defined since x 1. Then, 2x+1 y + 1 y 2 = + 1 x 1 2x+1 2 = x 1 (2x+1)+(x 1) x 1 (2x+1) 2(x 1) x 1 = 3x x 1 3 x 1 = 3x 3 = x. (b) Prove that if there is a real number y such that y+1 = x, then y 2 x 1. Proof. Let x = y+1 which is defined if y 2. Solving this y 2 equation for y, we have x = y+1 y 2 x(y 2) = y + 1 xy 2x = y + 1 xy y = 2x + 1 y(x 1) = 2x + 1 y = 2x+1. x 1 Therefore, in order for y to be defined, x must not be 1. 3

4 6. Prove that for every real number x, if x > 2 then there is a real number y such that y + 1 y = x. Proof. Let x be an arbitrary number, and suppose x > 2. Let y = x + x which is defined since x > 2. Then, y + 1 y = x + x x + x 2 4 = (x + x 2 4) (x + x 2 4) = (x2 + 2x x (x 2 4)) + 4 2(x + x 2 4) = 2x2 + 2x x 2 4 2(x + x 2 4) = 2x(x + x 2 4) 2(x + x 2 4) = x. 7. Prove that if F is a family of sets and A F, then A F. Proof. Suppose A F. Let x be an armitrary element of F. Since A F and x A, x F. Therefore, clearly, x F. But x was an arbitrary element of F, so this shows that A F. 4

5 8. Prove that if F is a family of sets and A F, then F A. Proof. Suppose A F. Let x be an arbitrary element of F. Then by the definition , A(A F x A). Since A F and A(A F x A), it follows that x A. But x was an arbitrary element of F, so this shows that F A, as required. 9. Suppose F and G are families of sets. Prove that if F G then F G. Proof. Suppose F G. Let x be an arbitrary element of F. By definition , x F means A(A F x A). Then, since A F and F G, A G. Therefore, it follows that A(A G x A). But x was an arbitrary element of F, so this shows that F G, as required. 10. Suppose F and G are nonempty families of sets. Prove that if F G then G F. Proof. Suppose F G. Let A be an arbitrary element of F. Then since F G and A F, A G. Now, let x be an arbitrary element of G, which is defined since G is nonempty. Then, by the definition , A(A G x A). Thus, 5

6 x A. Since A was an arbitrary element of F and x A, it follows that x F, which is defined since F is nonempty. But x was an arbitrary element of G, so this shows that G F. 11. Suppose {A i i I} is an indexed family of sets. Prove that i I P(A i ) P( i I A i ). (Hint: First make sure you know what all the notation means!) Proof. Suppose {A i i I} is an indexed family of sets. Let x be an arbitrary element of i I P(A i ). Let y be an arbitrary element of x. Then, by the alternative notation of union of an indexed family of sets, i I( y(y x y A i )). In other words, there exists some i 0 I such that every element of x is an element of A i0. Therefore, y i I A i. Since y was an arbirary element of x and y i I A i, we can conclude that x P( i I A i ). But x was an arbitrary element of i I P(A i ), so this shows that i I P(A i ) P( i I A i ), as required. 12. Prove the converse of the statement proven in Example In other words, prove that if F P(B) then F B. Proof. Suppose F P(B). Let x be an arbitrary element of F. Then by definition , A(A F x A). In other words, there exists some set A such that A F and x A. Since A F and F P(B), A P(B). Then, by the definition of power set, all the element of A is an element of B. Since x A, we can conclude x B. But x was an arbitrary element of F, so this shows that F B, as required. 6

7 13. Suppose F and G are nonempty families of sets, and every element of F is a subset of every element of G. Prove that F G. Proof. Suppose F and G are nonempty families of sets, and every element of F is a subset of every element of G. Let x be an arbitrary element of F. Then, by definition , A(A F x A). In other words, there exists some set A such that A F and x A. Since A F and every element of F is a subset of every element of G, A G. Therefore, since A G and x A, by the definition , x G, which is defined since G is not an emptyset. But x was an arbitrary element of F, so this shows that F G, as required. 14. In this problem all variables range over Z, the set of all integers. (a) Prove that if a b and a c, then a (b + c). Proof. Let a, b, and c be arbitrary integers and suppose a b and a c. Since a b, we can choose some integer m such that ma = b. Similarly, since a c, we can choose an integer n such that na = c. Therefore b + c = ma + na = (m + n)a, so since m + n is an integer, a (b + c). (b) Prove that if ac bc and c 0, then a b. Proof. Let a, b, and c be arbitrary integers and suppose ac bc and c 0. Since ac bc, we can choose some integer m such that mac = bc. Since c 0, we can devide both sides by c. Therefore ma = b, so since m is an integer, a b. 7

8 15. Consider the following theorem: Theorem. For every real number x, x 2 0. What s wrong with the following proof of the theorem? Proof. Suppose not. Then for every real number x, x 2 < 0. In particular, plugging in x = 3 we would get 9 < 0, which is clearly false. This contradiction shows that for every number x, x 2 0. We cannot let one example, x = 3 represent the whole set of real numbers for the statement to a contradiction. Proof. There are three cases to be considered: x < 0, x = 0, and x > 0. Case 1. x < 0. Since x < 0, multiplying both sides by x, we would get x x > 0 x, which is equivalent to x 2 > 0. Case 2. x = 0. Multiplying both sides by x, we would get x x = 0 x, which is equivalent to x 2 = 0. Case 3. x > 0. Since x > 0, multiplying both sides by x, we would get x x > 0 x, which is equivalent to x 2 > 0. Therefore, we have shown that for every real number x, x 2 0 (the equality holds only when x = 0). 8

9 16. Consider the following incorrect theorem: Incorrect Theorem. If x A(x 0) and A B then x B(x 0). (a) What s wrong with the following proof of the theorem? Proof. Let x be an arbitrary element of A. Since x A(x 0), we can conclude that x 0. Also since A B, x B. Since x B, x 0, and x was arbitrary, we can conclude that x B(x 0). (p. 105) In particular, you must not assume that x is equal to any other object already under discussion in the proof. We cannot assume that x 0 is also true for B without appropriate argument. (b) Find a counterexample to the theorem. In other words, find an example of sets A and B for which the hypotheses of the theorem are true but the conclusion is false. Let A be a set of all positive integers (A = Z + ), and B be a set of all integers (B = Z). By the definition of Z +, A does not have 0 as its element. Furthermore, all the elements in A belong to B, so A B is true. But then, by the definition of Z, 0 is an element of B, so this theorem is not true. 17. Consider the following incorrect theorem: Incorrect Theorem. x R y R(xy 2 = y x). 9

10 What s wrong with the following proofs of the theorem? Proof. Let x = y/(y 2 + 1). Then y x = y y y 2 +1 = y3 = y 2 +1 y y 2 +1 y2 = xy 2. Depending on the value of y, x will change its value. Furthermore, since the goal is to find x such that y R(xy 2 = y x), we cannot start the proof by assigning some value to x. 18. Consider the following incorrect theorem: Incorrect Theorem. Suppose F and G are families of sets. If F and G are disjoint, then so are F and G. (a) What s wrong with the following proof of the theorem? Proof. Suppose F and G are disjoint. Suppose F and G are not disjoint. Then we can choose some set A such that A F and A G. Since A F, by exercise 7, A F, so every element of A is in F. Similarly, since A G, every element of A is in G. But then every element of A is in both F and G, and this is impossible since F and G are disjoint. Thus, we have reached a contradiction, so F and G must be disjoint. If A in the proof is not an empty set, then the contradiction holds. But if A is an empty set, even though elements of other sets in F and G do not duplicate each other, the contradiction does not hold. In other words, there is an occasion such that F G = A, but ( F) ( G) =, even though none of the other sets in F and G duplicates each other. 10

11 (b) Find a counterexample to the theorem. For example, suppose F = {A, E}, where A is an empty set, and E is a set of all even numbers. Suppose G = {A, O}, where A is, again, an emptyset, and O is a set of all odd numbers. Then ( F) ( G) =, but F G = A, which is a set with an empty set as its element. 19. Prove that for every real number x there is a real number y such that for every real number z, yz = (x + z) 2 (x 2 + z 2 ). Proof. We will consider two cases z = 0 and z 0. Case 1. z = 0. yz = y 0 = 0, and (x + z) 2 (x 2 + z 2 ) = (x + 0) 2 (x ) = x 2 x 2 = 0. Therefore, no matter what y is, the equality holds. Case 2. z 0. Let x and z arbitrary real numbers, and y = 2x. Then, yz = (2x)z = 2xz = x 2 + 2xz + z 2 (x 2 + z 2 ) = (x + z) 2 (x 2 + z 2 ) By Case 1, we know that the value of y does not matter if z = 0. So we can let y = 2x for both cases. (a) Comparing the various rules for dealing with quantifiers in proofs, you should see a similarity between the rules for goals of the form xp (x) and givens of the form xp (x). What is this similarity? What about the rules for goals of the form xp (x) and givens of the form xp (x)? 11

12 To prove a goal of the form: xp (x) Let x stand for an arbitrary object, and prove P (x). (If the letter x already stands for something in the proof, you will have to use a different letter for the arbitrary object.) To use a given of the form: xp (x) Introduce a new variable, say x 0, into the proof, to stand for a particular object for which P (x 0 ) is true. The both of these rules above help us decide what fundamental properties we assign in x. To prove a goal of the form: xp (x) Find a value of x that makes P (x) true. Prove P (x) for this value of x. To use a given of the form: xp (x) You may plug in any value, say a for x, and conclude that P (a) is true. Both of these rules above are applied to add more properties to x that will help us prove the theories. (b) Can you think of a reason why these similarities might be expected? (Hint: Think about how proof by contradiction works when the goal starts with a quantifier.) Proof by contradiction works by negating the goals and adding them as givens and lead to a contradiction. If we negate our goals involving quantifiers, then by the quantifier negation law, existential quantifiers become universal, and vice versa, and, goals change into givens. Naturally, these similarities are expected. 12

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

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

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

Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014

Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the

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

Handout #1: Mathematical Reasoning

Handout #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 information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5. PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

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

Quotient Rings and Field Extensions

Quotient 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 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

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

Predicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.

Predicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal. Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is

More information

Boolean Algebra Part 1

Boolean Algebra Part 1 Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems

More information

INTRODUCTORY SET THEORY

INTRODUCTORY SET THEORY M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

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

How To Understand The Theory Of Algebraic Functions

How To Understand The Theory Of Algebraic Functions Homework 4 3.4,. Show that x x cos x x holds for x 0. Solution: Since cos x, multiply all three parts by x > 0, we get: x x cos x x, and since x 0 x x 0 ( x ) = 0, then by Sandwich theorem, we get: x 0

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

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

FACTORING ax 2 bx c. Factoring Trinomials with Leading Coefficient 1

FACTORING ax 2 bx c. Factoring Trinomials with Leading Coefficient 1 5.7 Factoring ax 2 bx c (5-49) 305 5.7 FACTORING ax 2 bx c In this section In Section 5.5 you learned to factor certain special polynomials. In this section you will learn to factor general quadratic polynomials.

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

Using the ac Method to Factor

Using the ac Method to Factor 4.6 Using the ac Method to Factor 4.6 OBJECTIVES 1. Use the ac test to determine factorability 2. Use the results of the ac test 3. Completely factor a trinomial In Sections 4.2 and 4.3 we used the trial-and-error

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

Elementary 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. 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 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

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

Chapter 9. Systems of Linear Equations

Chapter 9. Systems of Linear Equations Chapter 9. Systems of Linear Equations 9.1. Solve Systems of Linear Equations by Graphing KYOTE Standards: CR 21; CA 13 In this section we discuss how to solve systems of two linear equations in two variables

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

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

k, then n = p2α 1 1 pα k

k, 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 information

So let us begin our quest to find the holy grail of real analysis.

So 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 information

1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]

1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ] 1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not

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

Factoring Quadratic Expressions

Factoring Quadratic Expressions Factoring the trinomial ax 2 + bx + c when a = 1 A trinomial in the form x 2 + bx + c can be factored to equal (x + m)(x + n) when the product of m x n equals c and the sum of m + n equals b. (Note: the

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

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

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

1.4. Arithmetic of Algebraic Fractions. Introduction. Prerequisites. Learning Outcomes

1.4. Arithmetic of Algebraic Fractions. Introduction. Prerequisites. Learning Outcomes Arithmetic of Algebraic Fractions 1.4 Introduction Just as one whole number divided by another is called a numerical fraction, so one algebraic expression divided by another is known as an algebraic fraction.

More information

Automata and Formal Languages

Automata 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 information

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 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 information

How To Factorize Of Finite Abelian Groups By A Cyclic Subset Of A Finite Group

How To Factorize Of Finite Abelian Groups By A Cyclic Subset Of A Finite Group Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is

More information

Solutions Manual for How to Read and Do Proofs

Solutions Manual for How to Read and Do Proofs Solutions Manual for How to Read and Do Proofs An Introduction to Mathematical Thought Processes Sixth Edition Daniel Solow Department of Operations Weatherhead School of Management Case Western Reserve

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

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

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4) ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x

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

(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9

(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9 Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned

More information

Applications of Fermat s Little Theorem and Congruences

Applications of Fermat s Little Theorem and Congruences Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4

More information

a 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.

a 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 information

Section 4.2: The Division Algorithm and Greatest Common Divisors

Section 4.2: The Division Algorithm and Greatest Common Divisors Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948

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

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

4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:

4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2: 4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets

More information

1(a). How many ways are there to rearrange the letters in the word COMPUTER?

1(a). How many ways are there to rearrange the letters in the word COMPUTER? CS 280 Solution Guide Homework 5 by Tze Kiat Tan 1(a). How many ways are there to rearrange the letters in the word COMPUTER? There are 8 distinct letters in the word COMPUTER. Therefore, the number of

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

Factoring Trinomials: The ac Method

Factoring Trinomials: The ac Method 6.7 Factoring Trinomials: The ac Method 6.7 OBJECTIVES 1. Use the ac test to determine whether a trinomial is factorable over the integers 2. Use the results of the ac test to factor a trinomial 3. For

More information

Definitions 1. A factor of integer is an integer that will divide the given integer evenly (with no remainder).

Definitions 1. A factor of integer is an integer that will divide the given integer evenly (with no remainder). Math 50, Chapter 8 (Page 1 of 20) 8.1 Common Factors Definitions 1. A factor of integer is an integer that will divide the given integer evenly (with no remainder). Find all the factors of a. 44 b. 32

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

Math 3000 Section 003 Intro to Abstract Math Homework 2

Math 3000 Section 003 Intro to Abstract Math Homework 2 Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these

More information

3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.

3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9. SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid

More information

The Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic The Fundamental Theorem of Arithmetic 1 Introduction: Why this theorem? Why this proof? One of the purposes of this course 1 is to train you in the methods mathematicians use to prove mathematical statements,

More information

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 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 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

E3: PROBABILITY AND STATISTICS lecture notes

E3: PROBABILITY AND STATISTICS lecture notes E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................

More information

26 Integers: Multiplication, Division, and Order

26 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 information

Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.

Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p. Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a

More information

Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

More information

Putnam Notes Polynomials and palindromes

Putnam Notes Polynomials and palindromes Putnam Notes Polynomials and palindromes Polynomials show up one way or another in just about every area of math. You will hardly ever see any math competition without at least one problem explicitly concerning

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

Practice with Proofs

Practice with Proofs Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

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

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

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).

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

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column

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

Math 223 Abstract Algebra Lecture Notes

Math 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 information

COLLEGE ALGEBRA 10 TH EDITION LIAL HORNSBY SCHNEIDER 1.1-1

COLLEGE ALGEBRA 10 TH EDITION LIAL HORNSBY SCHNEIDER 1.1-1 10 TH EDITION COLLEGE ALGEBRA LIAL HORNSBY SCHNEIDER 1.1-1 1.1 Linear Equations Basic Terminology of Equations Solving Linear Equations Identities 1.1-2 Equations An equation is a statement that two expressions

More information

6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives 6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise

More information

Boolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra

Boolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra 2 Ver..4 George Boole was an English mathematician of XIX century can operate on logic (or Boolean) variables that can assume just 2 values: /, true/false, on/off, closed/open Usually value is associated

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

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

Vector and Matrix Norms

Vector and Matrix Norms Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

More information

Math Circle Beginners Group October 18, 2015

Math Circle Beginners Group October 18, 2015 Math Circle Beginners Group October 18, 2015 Warm-up problem 1. Let n be a (positive) integer. Prove that if n 2 is odd, then n is also odd. (Hint: Use a proof by contradiction.) Suppose that n 2 is odd

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

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 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

More information

Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.

Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Are the following sentences propositions? oronto

More information

Limits and Continuity

Limits and Continuity Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function

More information

How To Solve Factoring Problems

How To Solve Factoring Problems 05-W4801-AM1.qxd 8/19/08 8:45 PM Page 241 Factoring, Solving Equations, and Problem Solving 5 5.1 Factoring by Using the Distributive Property 5.2 Factoring the Difference of Two Squares 5.3 Factoring

More information

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013

More information

SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

More information

4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

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

2 : two cube. 5 : five cube. 10 : ten cube.

2 : two cube. 5 : five cube. 10 : ten cube. Math 105 TOPICS IN MATHEMATICS REVIEW OF LECTURES VI Instructor: Line #: 52920 Yasuyuki Kachi 6 Cubes February 2 Mon, 2015 We can similarly define the notion of cubes/cubing Like we did last time, 3 2

More information

6.3 FACTORING ax 2 bx c WITH a 1

6.3 FACTORING ax 2 bx c WITH a 1 290 (6 14) Chapter 6 Factoring e) What is the approximate maximum revenue? f) Use the accompanying graph to estimate the price at which the revenue is zero. y Revenue (thousands of dollars) 300 200 100

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

Answer Key for California State Standards: Algebra I

Answer 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 information

CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation

CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation Prof. David Marshall School of Computer Science & Informatics Factorisation Factorisation is a way of

More information

15 Prime and Composite Numbers

15 Prime and Composite Numbers 15 Prime and Composite Numbers Divides, Divisors, Factors, Multiples In section 13, we considered the division algorithm: If a and b are whole numbers with b 0 then there exist unique numbers q and r such

More information

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