# Predicate in English. Predicates and Quantifiers. Propositional Functions: Prelude. Predicate in Logic. Propositional Function

Save this PDF as:

Size: px
Start display at page:

Download "Predicate in English. Predicates and Quantifiers. Propositional Functions: Prelude. Predicate in Logic. Propositional Function"

## Transcription

1 Predicates and Quantifiers By Chuck Cusack Predicate in English In English, a sentence has 2 parts: the subject and the predicate. The predicate is the part of the sentence that states something about the subject. For example, in the sentence John Cusack was in the movie Say Anything, John Cusack is the subject, and was in the movie Say Anything is the predicate. 1 2 Predicate in Logic In logic, a predicate is something that is affirmed or denied about the argument of a proposition. For example, in the proposition x was in the movie Say Anything, x is the argument, and was in the movie Say Anything is the predicate. In logic, however, the argument does not always correspond to the subject. For instance, in the proposition John Cusack was in the movie x, x is the argument, and John Cusack was in the movie is the predicate. You might prefer to word the predicate as is a movie that John Cusack was in. Propositional Functions: Prelude Recall that a proposition is a statement that is either true or false. You can think of a function as a black box which takes one or more inputs, and produces a single output. You may have learned that a function has a domain (the set of possible inputs) and a range (the set of possible outputs). Example: We can define the function square which takes as input an integer x, and outputs its square, x 2. The domain is set of integers, and the range is the set of positive integers. 3 4 Propositional Function A propositional function is a function which Takes one or more arguments. Expresses a predicate involving the argument(s). Becomes a proposition when values are assigned to the arguments. The domain of a propositional function is the set of possible values of the arguments. Note: The domain must be defined so that the value of the propositional function is a proposition for every element of the domain. The range of a propositional function is the set of propositions formed by replacing the arguments with each of the possible values from the domain. 5 Propositional Function Example Let P(x)= John Cusack was in the movie x. Notice that P(x) is not a proposition, since it is neither true nor false. However, P(The Matrix)= John Cusack was in the movie The Matrix is a proposition with truth value false. In fact, for any movie title x, P(x) is either true or false. Therefore, P is a propositional function. The domain of P is the set of all movie titles. (e.g. P(laptop) is not a proposition.) The range of P is the set of all propositions of the form John Cusack was in the movie x, where x is a movie title. 6 1

2 Universe of Discourse We all know that a universe is a particular sphere of interest, activity, or experience. You may know that discourse is written or spoken communication. So the universe of discourse could be defined loosely as the set of all things we wish to talk about. With this in mind, perhaps it is easy to see why the domain of a propositional function is also called the universe of discourse. Example: What should the universe of discourse be for the propositional function P(x)= This week the Huskers play against x 7 Multiple Argument Examples We mentioned earlier that propositional functions can have more than one argument. Example 1: Let P(x,y) = x was in the movie y. P(Kevin Bacon, The Matrix) = Kevin Bacon was in the movie The Matrix. P(Kevin Bacon,The Matrix) is a proposition with with truth value false. What is the universe of discourse for x? How about y? For x, the set of all possible actors. For y, the set of all possible movies. 8 Multiple Argument Examples Example 2: Let P(w,x,y,z) = x w +y w =z w, where the universe of discourse for w is the set of all positive integers, and for x, y, and z is the set of all integers. P(2,3,4,5) is the proposition =5 2, which has truth value true. For what values of w, x, y, and z, is P(w,x,y,z) false? (Hint: Have you heard of Fermat s Last Theorem?) Example 3: Let P(x,y)= x was in a movie with y. What should the universe of discourse for x and y be? What is the truth value of P(Kevin Bacon, Jet Li)? 9 Another Example Example 4: Let P(x)= x was a movie. We can write the statement The Matrix was a movie as P(The Matrix). We can write the statement The Matrix and E.T. were movies as P(The Matrix) P(E.T.). How should I express a statement like All things are movies, or There is at least one movie, or Not everything is a good movie? What about with notation like for all x, P(x) is true, or not for all x, P(x) is true, or for some x, P(x) is false, or there is some x for which P(x) is true. These sort of do the job, but are too cumbersome. 10 Quantifiers As the last example demonstrates, there are times when we wish to know whether or not a propositional function is true for all members of the universe of discourse, or no member of the universe of discourse, or any member of the universe universe of discourse. This is where quantifiers come in. A quantifier is an expression that indicates the scope of something, specifically in terms of quantity. In logic, the two quantifiers we are concerned about are all or every, and some, an, or at least one. Universal Quantification From our previous definitions of universal and quantifier, hopefully you can guess that the universal quantifier expresses all or every. The universal quantification of a propositional function P(x) is the proposition for all x in the universe of discourse, P(x) is true We can shorten this to for all x P(x) or for every x P(x). The notation for this is x P(x). The symbol is called the universal quantifier

3 Existential Quantification The word existential relates to existence. Thus, the existential quantifier expresses some, an, or at least one. The existential quantification of a propositional function P(x) is the proposition there exists an element x in the universe of discourse such that P(x) is true. We can shorten this to there exists an x such that P(x), for some x P(x), or there exists at least one x such that P(x). The notation for this is x P(x). The symbol is called the existential quantifier, and is usually pronounced there exists. 13 Truth Values of Quantifiers If the universe of discourse for P is {p 1, p 2,, p n }, then x P(x) P(p 1 ) P(p 2 ) P(p n ), and x P(x) P(p 1 ) P(p 2 ) P(p n ). From this, we can easily determine the truth values of the quantifiers. The statement x P(x) x P(x) Truth Values of Quantifiers is true when P(x) is true for every x There is at least one x for which P(x) is true is false when There is at least one x for which P(x) is false P(x) is false for every x 14 Quantifier Examples Let P(x)= x must take a discrete mathematics course, and S(x)= x is a computer science student, where the universe of discourse for both is all students in a particular college. The statement Every computer science student must take a discrete mathematics course can be expressed as x (S(x) P(x)) The statement Everybody must take a discrete mathematics course or be a computer science student can be expressed as x (S(x) P(x)) More Quantifier Examples Let P(x,y)= x+y>10 where the universe of discourse for x and y is the set of integers. The statement For every x and every y, x+y>10 can be expressed as x y P(x,y) The statement For every x, there is some value y such that x+y>10 can be expressed as x y P(x,y) The statement There is a value of y such that for every x, x+y>10 can be expressed as y x P(x,y) Example Continued Let P(x,y)= x+y>10. What are the truth values of x y P(x,y), x y P(x,y), and y x P(x,y)? Since P(1,1) is clearly false, x y P(x,y) is also false. For any x, if we choose y=-x+11, then P(x,y) = P(x,-x+11) = x+(-x+11)>10 = 11>10, which is clearly true, so x y P(x,y) is true. For any y, if x = -y, P(x,y) = x+(-x)>10 = 0>10, which is false. This means we cannot find any y which works with all x, so y x P(x,y) is false. What are the truth values if the universe of discourse is the set of positive integers? 17 2-Variable Quantifications The last example demonstrates that the truth values of x y P(x,y) and y x P(x,y) are not necessarily the same. In other words, the order of quantification can matter. Hopefully it is clear that x y P(x,y) and y x P(x,y) will always have the same truth value, as will x y P(x,y) and y x P(x,y). The chart on the next page shows when 2-variable quantifications are true and false. We could develop similar charts for quantifications with more variables, but these will suffice for our use. 18 3

4 The statement Truth Values for 2-Variable Quantifications x y P(x,y) y x P(x,y) x y P(x,y) x y P(x,y) x y P(x,y) y x P(x,y) Truth Values of 2-Variable Quantifiers is true when P(x,y) is true for every pair x,y. for every x, there is a y for which P(x,y) is true. there is an x for which P(x,y) is true for every y. is false when there is at least one pair x, y for which P(x,y) is false. there is an x for which P(x,y) is false for every y. for every x, there is a y for which P(x,y) is false. there is at least one pair x, P(x,y) is false for every pair y for which P(x,y) is true. x,y. The Unique Parent Write the English sentence Everybody has exactly one biological mother as a logical expression. Let P(x,y)= x is the biological mother of y. The expression y x P(x,y) looks correct. However, this expresses the sentence Everybody has a biological mother, which doesn t guarantee that somebody doesn t have more than one. We need to express that a person can have at most one. The correct solution is y x z ( P(x,y) [ (z x) P(z,y) ] ) Mathematical Laws Problems: 1. What does the logical expression x y (x+y = y+x) mean, where the universe of discourse for x and y is the set of real numbers? What is its truth value? 2. What does the logical expression x y (x*y = 1) mean, where the universe of discourse for x and y is the set of rational numbers? What is its truth value? Solutions: 1. This is simply the commutative law of addition for real numbers, which is true. 2. This is the multiplicative inverse law for rational numbers, which is true. More Mathematical Laws? Problems: 1. What does the logical expression x y (x-y = y-x) mean, where the universe of discourse for x and y is the set of real numbers? What is its truth value? 2. What does the logical expression x y (x*y = 1) mean, where the universe of discourse for x and y is the set of integers? What is its truth value? Solutions: 1. This would be the commutative law of subtraction for real numbers, but it doesn t exist, since it is false. 2. This would be the multiplicative inverse law for integers, but there is no such law, since it is false A Special Number Express the statement there is a number x such that when it is added to any number, the result is that number, and if it is multiplied by any number, the result is x as a logical expression. Let P(x,y) = x+y = y, and Q(x,y) = x*y = x. Then the solution is x y ( P(x,y) Q(x,y) ) Which we can also write as x y ( (x+y = y) (x*y = x) ) And the Number is What is the truth value of x y ( (x+y = y) (x*y = x) ) if the universe of discourse for x and y is the set of integers? Real numbers? Rational numbers? Positive integers? If the truth value is true, what is the value x? For the set of integers, real numbers, and rational numbers, the expression is true, with x=0. For the set of positive integers, the truth value is false

5 Negations and Quantifiers I Express the statement Not everybody can ride a bike as a logical expression. Let P(x)= x can ride a bike. The statement everybody can ride a bike, can be expressed as x P(x). We want the negation of this, which is x P(x). Another way to say this is There is somebody that cannot ride a bike, which can be expressed as x P(x). Negations and Quantifiers II Express the statement Nobody can fly. as a logical expression. Let P(x)= x can fly. The statement somebody can fly, can be expressed as x P(x). We want the negation of this, which is x P(x). Another way to say this is Everybody can not fly, which can be expressed as x P(x) Negating Quantifiers: The Rules In the last two examples, we were able to express each statement in two different ways. In fact, for any propositional function, this is the case. The following chart shows the rules. Negating Quantifiers Negation Equivalent Is true when Is false when x P(x) x P(x) there is an x for which P(x) is false. P(x) is true for every x. x P(x) x P(x) P(x) is false for every x. there is an x for which P(x) is true. Exercises 1. What is the truth value of x y(x*y = y) if the universe of discourse for x and y is the set of real numbers? What does this expression mean? 2. Let Q(x,y) be the statement x is the capital city of y. What should the universe of discourse be for x and y? What are the truth values of x y Q(x,y) and x y Q(x,y)? 3. If P(x)= x<0, what are the truth values of P(2), P(0), and P(-1)? 4. Express the statement everybody in this class is a student in this university as a logical expression. 5. Express the statement Either somebody has taken every class, or everybody has taken exactly one class as a logical expression. 6. Let A be an array of size n, and P(i)= A[i]=0. You need to implement the following: If( x P(x)) Initialize all elements of A to 0 Give C++ or Java code to implement this. What does this code do? More Exercises 7. Let P(x,y) = x is a factor of y, where the universe of discourse for x is {1,2,3, } and for y is {2,3,4, }. Let Q(y) = x ( P(x,y) [ (x = y) (x = 1) ] ). When is Q(y) true? Give an alternative way of writing Q(y). 8. Let P(x,y) = x 2 - y 2 = 0, where the universe of discourse for x and y is the set of integers. What are the truth values of P(4,-4), P(0,3), x y P(x,y), x y P(x,y), x y P(x,y), and y x P(x,y)? 9. Rewrite the expression x( y z P(x,y,z) z y P(x,y,z) ) so no negations appear to the left of a quantifier. 10. You need to create a random number generator that inputs an integer from 1 to 1,000,000 as a random seed, and outputs a random number from 1 to 1,000. It must be possible for each number between 1 and 1,000 to be generated. Express the requirements for this function using quantifier(s) and propositional function(s). 29 5

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

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

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 1, due Wedneday, January 25 1.1.10 Let p and q be the propositions The election is decided and The votes have been counted, respectively.

### Predicate Calculus. There are certain arguments that seem to be perfectly logical, yet they cannot be expressed by using propositional calculus.

Predicate Calculus (Alternative names: predicate logic, first order logic, elementary logic, restricted predicate calculus, restricted functional calculus, relational calculus, theory of quantification,

### 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)

### 3.1. RATIONAL EXPRESSIONS

3.1. RATIONAL EXPRESSIONS RATIONAL NUMBERS In previous courses you have learned how to operate (do addition, subtraction, multiplication, and division) on rational numbers (fractions). Rational numbers

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

### CS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers

CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)

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

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

### 2.3. Finding polynomial functions. An Introduction:

2.3. Finding polynomial functions. An Introduction: As is usually the case when learning a new concept in mathematics, the new concept is the reverse of the previous one. Remember how you first learned

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

### SIMPLIFYING SQUARE ROOTS

40 (8-8) Chapter 8 Powers and Roots 8. SIMPLIFYING SQUARE ROOTS In this section Using the Product Rule Rationalizing the Denominator Simplified Form of a Square Root In Section 8. you learned to simplify

### Properties 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

### The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

### Subjects, Predicates and The Universal Quantifier

Introduction to Logic Week Sixteen: 14 Jan., 2008 Subjects, Predicates and The Universal Quantifier 000. Office Hours this term: Tuesdays and Wednesdays 1-2, or by appointment; 5B-120. 00. Results from

### 0.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

### Invalidity in Predicate Logic

Invalidity in Predicate Logic So far we ve got a method for establishing that a predicate logic argument is valid: do a derivation. But we ve got no method for establishing invalidity. In propositional

### Lecture 16 : Relations and Functions DRAFT

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

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

### We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

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

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

### 2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

### 4. MATRICES Matrices

4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:

### Propositional Logic. Definition: A proposition or statement is a sentence which is either true or false.

Propositional Logic Definition: A proposition or statement is a sentence which is either true or false. Definition:If a proposition is true, then we say its truth value is true, and if a proposition is

### An Interesting Way to Combine Numbers

An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis November 28, 2007 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly

### Guide to SRW Section 1.7: Solving inequalities

Guide to SRW Section 1.7: Solving inequalities When you solve the equation x 2 = 9, the answer is written as two very simple equations: x = 3 (or) x = 3 The diagram of the solution is -6-5 -4-3 -2-1 0

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

### Accentuate the Negative: Homework Examples from ACE

Accentuate the Negative: Homework Examples from ACE Investigation 1: Extending the Number System, ACE #6, 7, 12-15, 47, 49-52 Investigation 2: Adding and Subtracting Rational Numbers, ACE 18-22, 38(a),

### 1.4 Factors and Prime Factorization

1.4 Factors and Prime Factorization Recall from Section 1.2 that the word factor refers to a number which divides into another number. For example, 3 and 6 are factors of 18 since 3 6 = 18. Note also that

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

### Chapter 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

### MATH 10034 Fundamental Mathematics IV

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

### Indiana 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

### The Deadly Sins of Algebra

The Deadly Sins of Algebra There are some algebraic misconceptions that are so damaging to your quantitative and formal reasoning ability, you might as well be said not to have any such reasoning ability.

### Solving 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,

### 1.6 The Order of Operations

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

### 3.4 Multiplying Polynomials

3.4 Multiplying Polynomials Let s turn our attention to the next basic operation on polynomials, multiplication. There are a number of ways to learn how to multiply polynomials, however, they all boil

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

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

### Announcements. CompSci 230 Discrete Math for Computer Science Sets. Introduction to Sets. Sets

CompSci 230 Discrete Math for Computer Science Sets September 12, 2013 Prof. Rodger Slides modified from Rosen 1 nnouncements Read for next time Chap. 2.3-2.6 Homework 2 due Tuesday Recitation 3 on Friday

parent ROADMAP MATHEMATICS SUPPORTING YOUR CHILD IN HIGH SCHOOL HS America s schools are working to provide higher quality instruction than ever before. The way we taught students in the past simply does

### Lies My Calculator and Computer Told Me

Lies My Calculator and Computer Told Me 2 LIES MY CALCULATOR AND COMPUTER TOLD ME Lies My Calculator and Computer Told Me See Section.4 for a discussion of graphing calculators and computers with graphing

### 4 Domain Relational Calculus

4 Domain Relational Calculus We now present two relational calculi that we will compare to RA. First, what is the difference between an algebra and a calculus? The usual story is that the algebra RA is

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

### Mathematical Induction

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

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

### Activity 1: Using base ten blocks to model operations on decimals

Rational Numbers 9: Decimal Form of Rational Numbers Objectives To use base ten blocks to model operations on decimal numbers To review the algorithms for addition, subtraction, multiplication and division

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### Negative Integer Exponents

7.7 Negative Integer Exponents 7.7 OBJECTIVES. Define the zero exponent 2. Use the definition of a negative exponent to simplify an expression 3. Use the properties of exponents to simplify expressions

### Number: Multiplication and Division with Reasoning

count in multiples of twos, fives and tens (copied from Number and Number: Multiplication and Division with Reasoning MULTIPLICATION & DIVISION FACTS Year 1 Year 2 Year 3 Year 4 Year 5 Year 6 count in

### Semantics for the Predicate Calculus: Part I

Semantics for the Predicate Calculus: Part I (Version 0.3, revised 6:15pm, April 14, 2005. Please report typos to hhalvors@princeton.edu.) The study of formal logic is based on the fact that the validity

### MATH 65 NOTEBOOK CERTIFICATIONS

MATH 65 NOTEBOOK CERTIFICATIONS Review Material from Math 60 2.5 4.3 4.4a Chapter #8: Systems of Linear Equations 8.1 8.2 8.3 Chapter #5: Exponents and Polynomials 5.1 5.2a 5.2b 5.3 5.4 5.5 5.6a 5.7a 1

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

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

### CHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.

CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:

### Equations, Inequalities, Solving. and Problem AN APPLICATION

Equations, Inequalities, and Problem Solving. Solving Equations. Using the Principles Together AN APPLICATION To cater a party, Curtis Barbeque charges a \$0 setup fee plus \$ per person. The cost of Hotel

### Joint Probability Distributions and Random Samples (Devore Chapter Five)

Joint Probability Distributions and Random Samples (Devore Chapter Five) 1016-345-01 Probability and Statistics for Engineers Winter 2010-2011 Contents 1 Joint Probability Distributions 1 1.1 Two Discrete

### Test1. Due Friday, March 13, 2015.

1 Abstract Algebra Professor M. Zuker Test1. Due Friday, March 13, 2015. 1. Euclidean algorithm and related. (a) Suppose that a and b are two positive integers and that gcd(a, b) = d. Find all solutions

### 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,

### 3. Logical Reasoning in Mathematics

3. Logical Reasoning in Mathematics Many state standards emphasize the importance of reasoning. We agree disciplined mathematical reasoning is crucial to understanding and to properly using mathematics.

### PROGRESSION THROUGH CALCULATIONS FOR MULTIPLICATION

PROGRESSION THROUGH CALCULATIONS FOR MULTIPLICATION THE FOLLOWING ARE STANDARDS THAT WE EXPECT THE MAJORITY OF CHILDREN TO ACHIEVE BY THE END OF THE YEAR. YR Related objectives: Count repeated groups of

### 2. THE x-y PLANE 7 C7

2. THE x-y PLANE 2.1. The Real Line When we plot quantities on a graph we can plot not only integer values like 1, 2 and 3 but also fractions, like 3½ or 4¾. In fact we can, in principle, plot any real

### If an English sentence is ambiguous, it may allow for more than one adequate transcription.

Transcription from English to Predicate Logic General Principles of Transcription In transcribing an English sentence into Predicate Logic, some general principles apply. A transcription guide must be

### 2.1 Sets, power sets. Cartesian Products.

Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects. - used to group objects together, - often the objects with similar properties This description of a set (without

### Solving Inequalities Examples

Solving Inequalities Examples 1. Joe and Katie are dancers. Suppose you compare their weights. You can make only one of the following statements. Joe s weight is less than Kate s weight. Joe s weight is

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

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### Style Guide For Writing Mathematical Proofs

Style Guide For Writing Mathematical Proofs Adapted by Lindsey Shorser from materials by Adrian Butscher and Charles Shepherd A solution to a math problem is an argument. Therefore, it should be phrased

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

### 3.4 Complex Zeros and the Fundamental Theorem of Algebra

86 Polynomial Functions.4 Complex Zeros and the Fundamental Theorem of Algebra In Section., we were focused on finding the real zeros of a polynomial function. In this section, we expand our horizons and

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

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

### Definition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.

8 Inequalities Concepts: Equivalent Inequalities Linear and Nonlinear Inequalities Absolute Value Inequalities (Sections 4.6 and 1.1) 8.1 Equivalent Inequalities Definition 8.1 Two inequalities are equivalent

### Revised 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.

### Equations and Inequalities

Rational Equations Overview of Objectives, students should be able to: 1. Solve rational equations with variables in the denominators.. Recognize identities, conditional equations, and inconsistent equations.

### You know from calculus that functions play a fundamental role in mathematics.

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

### 5.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

### Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li 2 Kishan Mehrotra 3 Syracuse University, New York L A TEX at January 11, 2007 (Part I) 1 No part of this book can be reproduced without permission from

### 10.4 Traditional Subject Predicate Propositions

M10_COPI1396_13_SE_C10.QXD 10/22/07 8:42 AM Page 445 10.4 Traditional Subject Predicate Propositions 445 Continuing to assume the existence of at least one individual, we can say, referring to this square,

### 4.2 Euclid s Classification of Pythagorean Triples

178 4. Number Theory: Fermat s Last Theorem Exercise 4.7: A primitive Pythagorean triple is one in which any two of the three numbers are relatively prime. Show that every multiple of a Pythagorean triple

### Lecture 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

### MATH 13150: Freshman Seminar Unit 10

MATH 13150: Freshman Seminar Unit 10 1. Relatively prime numbers and Euler s function In this chapter, we are going to discuss when two numbers are relatively prime, and learn how to count the numbers

### Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

### Frege s theory of sense

Frege s theory of sense Jeff Speaks August 25, 2011 1. Three arguments that there must be more to meaning than reference... 1 1.1. Frege s puzzle about identity sentences 1.2. Understanding and knowledge

### CHAPTER 2: METHODS OF PROOF

CHAPTER 2: METHODS OF PROOF Section 2.1: BASIC PROOFS WITH QUANTIFIERS Existence Proofs Our first goal is to prove a statement of the form ( x) P (x). There are two types of existence proofs: Constructive

### The program also provides supplemental modules on topics in geometry and probability and statistics.

Algebra 1 Course Overview Students develop algebraic fluency by learning the skills needed to solve equations and perform important manipulations with numbers, variables, equations, and inequalities. Students

### Algebraic expressions are a combination of numbers and variables. Here are examples of some basic algebraic expressions.

Page 1 of 13 Review of Linear Expressions and Equations Skills involving linear equations can be divided into the following groups: Simplifying algebraic expressions. Linear expressions. Solving linear

### Operations and Algebraic Thinking Represent and solve problems involving multiplication and division.

Performance Assessment Task The Answer is 36 Grade 3 The task challenges a student to use knowledge of operations and their inverses to complete number sentences that equal a given quantity. A student

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

### 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,

### 4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

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

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

### Order of Operations. 2 1 r + 1 s. average speed = where r is the average speed from A to B and s is the average speed from B to A.

Order of Operations Section 1: Introduction You know from previous courses that if two quantities are added, it does not make a difference which quantity is added to which. For example, 5 + 6 = 6 + 5.