321 Section Natalie Linnell. The importance of domains Domain is part of the function definition A predicate is a function from some domain to {T,F} If.

Slides:



Advertisements
Similar presentations
Elementary Number Theory and Methods of Proof
Advertisements

– Alfred North Whitehead,
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
1 Indirect Argument: Contradiction and Contraposition.
Chapter 4: Elementary Number Theory and Methods of Proof
Copyright © Cengage Learning. All rights reserved.
Discrete Structures Chapter 3: The Logic of Quantified Statements
Quantifiers and Negation Predicates. Predicate Will define function. The domain of a function is the set from which possible values may be chosen for.
1 Number Theory and Methods of Proof Content: Properties of integer, rational and real numbers. Underlying theme: Methods of mathematical proofs.
SETS A set B is a collection of objects such that for every object X in the universe the statement: “X is a member of B” Is a proposition.
Number Theory – Introduction (1/22) Very general question: What is mathematics? Possible answer: The search for structure and patterns in the universe.
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
SECTION 5-3 Selected Topics from Number Theory Slide
Section 4.3: Fermat’s Little Theorem Practice HW (not to hand in) From Barr Text p. 284 # 1, 2.
Introduction to Proofs
Russell’s Paradox Lecture 24 Section 5.4 Fri, Mar 10, 2006.
Week 3 - Monday.  What did we talk about last time?  Predicate logic  Multiple quantifiers  Negating multiple quantifiers  Arguments with quantified.
1 Section 1.1 A Proof Primer A proof is a demonstration that some statement is true. We normally demonstrate proofs by writing English sentences mixed.
Predicates and Quantified Statements M , 3.2.
+ 7.2 The Real nth Roots of a Number How many values in the domain of f are paired with the value in the range? That is, how many x values satisfy.
1 Methods of Proof Proof techniques in this handout –Direct proof –Division into cases –Proof by contradiction In this handout, the proof techniques will.
Nested Quantifiers Section 1.5.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Introduction to Proofs.
Methods of Proof Dr. Yasir Ali. Proof A (logical) proof of a statement is a finite sequence of statements (called the steps of the proof) leading from.
1 Introduction to Abstract Mathematics Proofs in Predicate Logic , , ~, ,  Instructor: Hayk Melikya Purpose of Section: The theorems.
4.1 Proofs and Counterexamples. Even Odd Numbers Find a property that describes each of the following sets E={…, -4, -2, 0, 2, 4, 6, …} O={…, -3, -1,
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
The Euler-Fermat Theorem Our text calls this “Euler’s Formula”, but I prefer the above name, giving due credit to Fermat. Obvious question: Can Fermat’s.
Pythagorean Theorem – Prove It! Converse of Pythagorean Theorem 1.) Is a triangle with side measures of 30, 40, and 50 units a right triangle? Prove it!
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
2.3 Real and Non Real Roots of a Polynomial Polynomial Identities Secondary Math 3.
Basic Definitions of Set Theory Lecture 23 Section 5.1 Wed, Mar 8, 2006.
Table of Contents Rational Expressions and Functions where P(x) and Q(x) are polynomials, Q(x) ≠ 0. Example 1: The following are examples of rational expressions:
Direct Proof and Counterexample III
22C:19 Discrete Structures Logic and Proof Fall 2014 Sukumar Ghosh.
Week 3 - Monday.  What did we talk about last time?  Predicate logic  Multiple quantifiers  Negating multiple quantifiers  Arguments with quantified.
Introduction to Proofs
Basic Definitions of Set Theory Lecture 23 Section 5.1 Mon, Feb 21, 2005.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
Lecture 1.5: Proof Techniques CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren 1.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Direct Proof and Counterexample III Part 2 Lecture 16 Section 3.3 Tue, Feb 13, 2007.
Lecture 1.5: Proof Techniques
Harper Langston New York University Summer 2017
CS 2210:0001 Discrete Structures Logic and Proof
Discrete Mathematics Lecture 3 (and 4)
Direct Proof by Contraposition Direct Proof by Contradiction
Lecture 1.5: Proof Techniques
321 Section, 2-7 Natalie Linnell.
11-6B Graph Inverse variation (Simple Rational Functions)
8.2 Graph Simple Rational Functions
The sum of any two even integers is even.
Indirect Proof by Contradiction Direct Proof by Cases
Copyright © Cengage Learning. All rights reserved.
Introduction to Predicates and Quantified Statements I
Lecture 1.6: Proof Techniques (contd)
Direct Proof and Counterexample I
Lecture 1.6: Proof Techniques (contd)
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
321 Section, Feb. 14 Natalie Linnell.
Lecture 5 Number Theory & Proof Methods
Introduction to Proofs
Ch. 11 Vocabulary 7.) Rational function 8.) Asymptote.
Introduction to Proofs
Presentation transcript:

321 Section Natalie Linnell

The importance of domains Domain is part of the function definition A predicate is a function from some domain to {T,F} If P(x) means that x is odd, the domain can’t be the real numbers

 x  (P(x)  Q(x))  X P(x)  x Q(x)

Artificially restricting the domain There is someone who has visited every country except for Libya.

 x  y(  InWith(x, Kevin)   InWith(x, y)  InWith(y, Kevin))) How do you translate this into English?

 x (P(x)  Q(x))  y(P(x)  Q(x))

Using constants There is someone in the class who speaks Hindi.

HW3, Problem 2

Show that if you pick three socks from a drawer containing just blue socks and black socks, you must get either a pair of blue socks or a pair of black socks.

Existence proofs (it’s ok to just give an example!)

 A  B Q(A,B)  B  A Q(A,B) Q(A,B) iff A  B

Is symmetric difference associative?

What does Fermat’s Little Theorem mean? a p-1 mod p = 1 if p is prime Can I use it to solve the following, and if so what’s the answer? What’s 2 4 mod 4? What’s 2 3 mod 5? What’s 2 4 mod 5? What’s mod 5?

Prove that if m and n are both perfect squares, then nm is a perfect square What kind of proof did you do?

Prove that if 3n+2 is odd, then n is odd What kind of proof did you do?

Show that the statement “Every positive integer is the sum of the squares of two integers” is false