Predicate Logic & Proofs Lecture 3
|
|
- Dora Summers
- 7 years ago
- Views:
Transcription
1 Topics for Today Necessary & sufficient conditions, Only if, If and only if CPRE 310 Discrete Mathematics Predicate Logic & Proofs Lecture 3 Quantified statements: predicates, quantifiers, truth values, negations Arguments with quantified statements Introduction to mathematical proof Homework & Quiz 2 Problems: Page 46-48: 5, 9, 11, 39, 55 Page 72-74: 3, 9, 19, 23 Page 85: 5, 7, 11, 17 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 2 Necessary and Sufficient Conditions Ex: What do the following sentences mean? Passing all the tests is a sufficient condition for passing the course. If a person passes all the tests, then the person will pass the course. Passing all the tests is a necessary condition for passing the course. If a person doesn t pass all the tests, then the person won t pass the course. Or: If a person passes the course, then the person will have passed all the tests. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 3 Definition A is a sufficient condition for B means if A then B (The occurrence of A guarantees the occurrence of B.) A is a necessary condition for B means if ~A then ~B (If A didn t occur, then B didn t occur either.) Or, equivalently, it means if B then A (If B occurred then A also had to occur.) January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 4 Class Exercises Write each of the following using if-then statements: 1. Making it to the final four is a necessary condition for the Blue Demons to win the championship. 2. Being appropriately dressed for a job interview is necessary (but not sufficient) for getting the job. 3. Getting all A's is sufficient (but not necessary) for graduating with honors. 4. Suppose a teacher says: Getting 100% correct on all the exams is both necessary and sufficient for earning an A in the course. What does this mean? Exercises, continued Write each of the following using if-then statements: 1. Making it to the final four is a necessary condition for the Blue Demons to win the championship. If the B.D. don t make it to the final four, they won t win the championship. If the B.D. win the championship, then they made it to the final four. 2. Being appropriately dressed for a job interview is necessary (but not sufficient) for getting the job. If a person is not appropriately dressed for a job interview, then the person won t get the job, but it can happen that a person is appropriately dressed and still doesn t get the job. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 5 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 6 1
2 Only if and the Biconditional 3. Getting all A's is sufficient (but not necessary) for graduating with honors. If a person gets all A s then they will graduate with honors, but it s possible to graduate with honors even if a person doesn t get all A s. 4. Suppose a teacher says: Getting 100% correct on all the exams is both necessary and sufficient for earning an A in the course. What does this mean? If a person earns an A in the course, then the person got 100% correct on all the exams, and if a person got 100% correct on all the exams, then the person got an A in the course. Ex: Write the following as an if-then statement: The Blue Demons will win the championship only if they make it to the final four. If the B.D. do not make it to the final four, then they will not win the championship. Or : If the B.D. win the championship, then they will have made it to the final four. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 7 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 8 Definition: Only If r only if s means if ~s then ~r (If s didn t occur, then r didn t occur either.) Or, equivalently, if r then s (If r occurred then s also had to occur.) Interpretation of If and Only If So: r only if s means if r then s and r if s means if s then r Thus: r if and only if s means r only if s and which means if r then s and r if s if s then r Fact: r s (r s) (s r) January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 9 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 10 Quantified Statements What is a predicate? A sentence that is not a statement but contains one or more variables and becomes a statement if specific values are substituted for the variables. The domain of a predicate variable is the set of allowable values for the variable. Ex: Let P(x) be the sentence x 2 > 4 where the domain of x is understood to be the set of all real numbers. Then P(x) is a predicate. Question: For what numbers x is P(x) true? Ans: The set of all real numbers for which x > 2 or x < -2. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 11 Truth Set of a Predicate The truth set of a predicate P(x) is the set of elements in the domain D of x for which P(x) is true. We write truth set of P(x) = {x D P(x)} and we read this as the set of all x in D such that P of x Note: The vertical line denotes the words such that for the set-bracket notation only. In other contexts, the words such that are symbolized by s.t. or s. th. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 12 2
3 Quantifiers How do we read the symbol? for all What is this symbol called? the universal quantifier How do we read the symbol? there exists What is this symbol called? the existential quantifier Consider: students x in this class, x has studied calculus. What would make this true? false? Also consider: a student x in this class such that x has studied calculus. What would make this true? false? January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 13 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 14 Truth Values of Universal and Existential Statements Class Exercises Universal statement: x in D, Q(x) is true if, and only if, Q(x) is true for each individual x in D. It is false if, and only if, Q(x) is false for at least one x in D. A value of x for which Q(x) is false is called a counterexample to the statement x in D, Q(x). Existential statement: x in D such that Q(x) is true if, and only if, Q(x) is true for at least one x in D. It is false if, and only if, Q(x) is false for each individual x in D. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 15 Indicate, if possible, which of the following statements are true and which are false, and rewrite them formally using a quantifier and a variable: 1. All even integers are positive. (False: -2 is a counterexample; it is even but not positive.) even integers n, n is positive. integers n, if n is even, then n is positive. n, if n is an even integer, then n is positive. 2. Some integers have integer square roots. (True: The number 4 has a square root of 2, which is an integer) an integer n such that n has an integer square root. n such that n is an integer and n has an integer square root. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 16 More Class Exercises Indicate, if possible, which of the following statements are true and which are false, and rewrite them formally using a quantifier and a variable: 3. No prime numbers are even. (False: The number 2 is even and prime.) prime numbers p, p is not even. integers p, if p is prime then p is not even. 4. If a person is a student in this class, then that person is at least 18 years old. (Implicit Quantification) (True?) people P, if P is a student in this class then P is at least 18 years old. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 17 Universal Conditional Statements Definition: Any statement of the following form is called a universal conditional statement: x in D, if P(x) then Q(x). January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 18 3
4 Example real numbers x, if x > 2 then x 2 > 4. More formal versions: 1. x R, if x > 2 then x 2 > 4. (R denotes the set of all real numbers) 2. x > 2 x 2 > 4. Notation: The symbol denotes a universalized if-then. So x > 2 x 2 > 4 means x R, x > 2 x 2 > 4 Quantified Statements Set Notation: x A means that x is an element of the set A, or x is in A. Important sets: R, the set of all real numbers (on paper: ) Q, the set of all rational numbers (on paper: ) Z, the set of all integers (on paper: ) R +, the set of all positive real numbers Z nonneg, the set of all nonnegative integers Etc. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 19 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 20 Negations of Quantified Statements Summary Write negations for the following statements. 1. students x in this class, x is at least 30 years old. Negation: a student x in this class such that x is less than 30 years old. 2. a student x in this class such that x is at least 70 years old. Negation: students x in this class, x is less than 70 years old. ( x in D, P(x)) x in D such that P(x) ( x in D such that P(x)) x in D, P(x) Note that the negation of a for all statement is a there exists statement, and the negation of a there exists statement is a for all statement. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 21 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 22 More Negations 3. real numbers x, x 2 > 0. x R, x 2 > 0. x, if x R, then x 2 > 0. x R x 2 > 0 Negation: a real number x such that x 2 0. Or: x R such that x a real number x such that x 2 = -1. x R such that x 2 = -1. x such that x R and x 2 = -1. Negation: real numbers x, x 2-1. Or: x R, x 2-1. Question ( x in D, if P(x) then Q(x))? x in D such that P(x) and ~Q(x) Ex: Write a negation for the following statement: real numbers x, if x 2 > 4 then x > 2. x R, if x 2 > 4 then x > 2. Negation: a real number x such that x 2 > 4 and x 2. Or: x R such that x 2 > 4 and x 2. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 23 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 24 4
5 A Weird Example Arguments with Quantified Statements True or false? All the elephants on this desk have two heads. What is the negation? Is there an elephant on this desk?? This statement is not false; so it has to be true! We call this vacuous truth or say that the statement is true by default. Universal instantiation: If a property is true for all the elements in a set, then it is true for each individual element of the set. Ex: For all real numbers a, b, and c, a(b + c) = ab + ac. Thus: = 7( ) = (= 742) And: If k is a real number, then 2 k k 5 = 2 k (3 + 5) (= 2 k 8 = 2 k 2 3 = 2 k +3 ) January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 25 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 26 Universal M.P. and M.T. Universal Modus Ponens: Ex: All men are mortal. ( x, if x is a man then x is mortal. So by universal instantiation: If Socrates is a man then Socrates is mortal.) Socrates is a man. Socrates is mortal. Universal Modus Tollens: Ex: All men are mortal. (So: If Zeus is a man then Zeus is mortal.) Zeus is not mortal. Zeus is not a man. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 27 Introduction to Number Theory and Methods of Proof Assumptions: Properties of the real numbers (Appendix A) basic algebra Logic Properties of equality: A = A If A = B, then B = A. If A = B and B = C, then A = C. Integers are 0, 1, 2, 3,, -1, -2,. Any sum, difference, or product of integers is an integer. Notation: refers to the universalized if and only if January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 28 Definition of Even and Odd An integer is even it can be expressed as 2 times some integer. An integer is odd it can be expressed as 2 times some integer plus 1. What it means for a definition to be : If an integer, say n, is even then an integer, say k, such that n = 2k, AND If an integer, say n, can be expressed as 2k, for some integer k, then n is even. Class Exercise Question: If k is an integer, is 2k 1 an odd integer? Reference: An integer is odd it can be expressed as 2 times some integer plus 1. Scratch work: Answer: Yes. Want: 2k 1 = 2( ) + 1 Note that k 1 is an integer because it is a difference of an integer integers. And Call the integer m. So we want: 2k 1 = 2m + 1 2(k 1) + 1 = 2k k 2 = 2m = 2k 1 k 1 = m January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 29 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 30 5
6 Question Some people say that an integer is even if it equals 2k. Are they right? Is 1 an even number? Let s Prove! Question: Is the sum of an even integer plus an odd integer always even? always odd? sometimes even and sometimes odd? Does 1 = 2k? 1 Yes: 1= 2 ( ) 2 So it s pretty important for k to be an integer! January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 31 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 32 Proving a Universal Statement Direct Proof Method of Generalizing from the Generic Particular: If a property can be shown to be true for a particular but arbitrarily chosen element of a set, then it is true for every element of the set. Direct Proof: Based on the Method of Generalizing from the Generic Particular To prove a statement of the form x in D, if <hypothesis> then <conclusion>, suppose x is a particular but arbitrarily chosen element in D such that <hypothesis> is true, and show that <conclusion> is true. January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 33 January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 34 Prove: integers x and y, if x is even and y is odd, then x + y is odd. Proof: Suppose x and y are any [particular but arbitrarily chosen] integers such that x is even and y is odd. [We must show that x + y is odd.] By definition of even and odd, x = 2a and y = 2b + 1 for some integers a and b. Then x + y = 2a + (2b +1) by substitution = 2(a + b ) + 1 by algebra. Let t = a + b. Then t is an integer because it is a sum of integers. Hence x + y = 2t + 1, where t is an integer, and thus by definition of odd, x + y is odd. [This is what we needed to show, and so we are done.] QED (QED stands for quod erat demonstrandum, Latin for which was to be shown. ) January 20, 2009 Lecture Notes Copyright 2009 S.C. Kothari all rights reserved. 35 6
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 informationIf n is odd, then 3n + 7 is even.
Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that
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 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 informationPredicate Logic. For example, consider the following argument:
Predicate Logic The analysis of compound statements covers key aspects of human reasoning but does not capture many important, and common, instances of reasoning that are also logically valid. For example,
More informationMath 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 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 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 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 informationLecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Lecture Notes in Discrete Mathematics Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 Preface This book is designed for a one semester course in discrete mathematics for sophomore or junior
More informationDISCRETE MATH: LECTURE 3
DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false
More informationSolutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
More 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 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 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 informationWOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology
First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Mid-Session Test Summer Session 008-00
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 informationPropositional 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 informationRules of Inference Friday, January 18, 2013 Chittu Tripathy Lecture 05
Rules of Inference Today s Menu Rules of Inference Quantifiers: Universal and Existential Nesting of Quantifiers Applications Old Example Re-Revisited Our Old Example: Suppose we have: All human beings
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More 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 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 informationChapter 1. Use the following to answer questions 1-5: In the questions below determine whether the proposition is TRUE or FALSE
Use the following to answer questions 1-5: Chapter 1 In the questions below determine whether the proposition is TRUE or FALSE 1. 1 + 1 = 3 if and only if 2 + 2 = 3. 2. If it is raining, then it is raining.
More information3. 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.
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 informationLikewise, we have contradictions: formulas that can only be false, e.g. (p p).
CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula
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 informationVariables in Mathematics Education
Variables in Mathematics Education Susanna S. Epp DePaul University, Department of Mathematical Sciences, Chicago, IL 60614, USA http://www.springer.com/lncs Abstract. This paper suggests that consistently
More informationExamination paper for MA0301 Elementær diskret matematikk
Department of Mathematical Sciences Examination paper for MA0301 Elementær diskret matematikk Academic contact during examination: Iris Marjan Smit a, Sverre Olaf Smalø b Phone: a 9285 0781, b 7359 1750
More informationLogic is a systematic way of thinking that allows us to deduce new information
CHAPTER 2 Logic Logic is a systematic way of thinking that allows us to deduce new information from old information and to parse the meanings of sentences. You use logic informally in everyday life and
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 informationCopy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}
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 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 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 informationVocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.
CHAPTER Vocabulary The table contains important vocabulary terms from Chapter. As you work through the chapter, fill in the page number, definition, and a clarifying example. biconditional statement conclusion
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 informationDigitalCommons@University of Nebraska - Lincoln
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-007 Pythagorean Triples Diane Swartzlander University
More informationPUTNAM 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 informationAn Innocent Investigation
An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number
More informationWOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology
First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121
More informationA Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions
A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25
More informations = 1 + 2 +... + 49 + 50 s = 50 + 49 +... + 2 + 1 2s = 51 + 51 +... + 51 + 51 50 51. 2
1. Use Euler s trick to find the sum 1 + 2 + 3 + 4 + + 49 + 50. s = 1 + 2 +... + 49 + 50 s = 50 + 49 +... + 2 + 1 2s = 51 + 51 +... + 51 + 51 Thus, 2s = 50 51. Therefore, s = 50 51. 2 2. Consider the sequence
More informationMathematics 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 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 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 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 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 informationSolutions 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 informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
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 informationA Few Basics of Probability
A Few Basics of Probability Philosophy 57 Spring, 2004 1 Introduction This handout distinguishes between inductive and deductive logic, and then introduces probability, a concept essential to the study
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 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 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 informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationCHAPTER 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:
More information1.3 Polynomials and Factoring
1.3 Polynomials and Factoring Polynomials Constant: a number, such as 5 or 27 Variable: a letter or symbol that represents a value. Term: a constant, variable, or the product or a constant and variable.
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 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 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 informationCurriculum Alignment Project
Curriculum Alignment Project Math Unit Date: Unit Details Title: Solving Linear Equations Level: Developmental Algebra Team Members: Michael Guy Mathematics, Queensborough Community College, CUNY Jonathan
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More information2.1. Inductive Reasoning EXAMPLE A
CONDENSED LESSON 2.1 Inductive Reasoning In this lesson you will Learn how inductive reasoning is used in science and mathematics Use inductive reasoning to make conjectures about sequences of numbers
More information2.1 Increasing, Decreasing, and Piecewise Functions; Applications
2.1 Increasing, Decreasing, and Piecewise Functions; Applications Graph functions, looking for intervals on which the function is increasing, decreasing, or constant, and estimate relative maxima and minima.
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 informationSolutions 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 informationPredicate Logic Review
Predicate Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane 1 Grammar A term is an individual constant or a variable. An individual constant is a lowercase letter from the beginning
More informationApplications 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 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 information3.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
More informationChapter 7. Functions and onto. 7.1 Functions
Chapter 7 Functions and onto This chapter covers functions, including function composition and what it means for a function to be onto. In the process, we ll see what happens when two dissimilar quantifiers
More informationCubes and Cube Roots
CUBES AND CUBE ROOTS 109 Cubes and Cube Roots CHAPTER 7 7.1 Introduction This is a story about one of India s great mathematical geniuses, S. Ramanujan. Once another famous mathematician Prof. G.H. Hardy
More information6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
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 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 informationP1. All of the students will understand validity P2. You are one of the students -------------------- C. You will understand validity
Validity Philosophy 130 O Rourke I. The Data A. Here are examples of arguments that are valid: P1. If I am in my office, my lights are on P2. I am in my office C. My lights are on P1. He is either in class
More informationBasic Set Theory. 1. Motivation. Fido Sue. Fred Aristotle Bob. LX 502 - Semantics I September 11, 2008
Basic Set Theory LX 502 - Semantics I September 11, 2008 1. Motivation When you start reading these notes, the first thing you should be asking yourselves is What is Set Theory and why is it relevant?
More informationAlgebra I. In this technological age, mathematics is more important than ever. When students
In this technological age, mathematics is more important than ever. When students leave school, they are more and more likely to use mathematics in their work and everyday lives operating computer equipment,
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationPigeonhole 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 informationOrder of Operations More Essential Practice
Order of Operations More Essential Practice We will be simplifying expressions using the order of operations in this section. Automatic Skill: Order of operations needs to become an automatic skill. Failure
More informationIncenter Circumcenter
TRIANGLE: Centers: Incenter Incenter is the center of the inscribed circle (incircle) of the triangle, it is the point of intersection of the angle bisectors of the triangle. The radius of incircle is
More informationInvalidity 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
More informationQuestion: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?
ECS20 Discrete Mathematics Quarter: Spring 2007 Instructor: John Steinberger Assistant: Sophie Engle (prepared by Sophie Engle) Homework 8 Hints Due Wednesday June 6 th 2007 Section 6.1 #16 What is the
More informationINTRODUCTORY 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 informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More 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 informationMath 115 Spring 2011 Written Homework 5 Solutions
. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence
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 information6 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 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 informationPredicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering
Predicate logic SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier University Predicate logic Slide 1/24
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 informationClock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system
CHAPTER Number Theory FIGURE FIGURE FIGURE Plus hours Plus hours Plus hours + = + = + = FIGURE. Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter described a mathematical
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 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 informationCS510 Software Engineering
CS510 Software Engineering Propositional Logic Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15-cs510-se
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 information