1 Review for Quiz 1. 2 Summations 3 Binomial expansion.

Slides:



Advertisements
Similar presentations
Mathematical Induction
Advertisements

PROOF BY CONTRADICTION
To prove by induction that 2 n ≥ n 2 for n ≥ 4, n  N Next (c) Project Maths Development Team 2011.
Practice Quiz 3 Recursive Definitions Relations Basic Counting Pigeonhole Principle Permutations & Combinations Discrete Probability.
 The running time of an algorithm as input size approaches infinity is called the asymptotic running time  We study different notations for asymptotic.
MA/CSSE 473/474 How (not) to do an induction proof.
Get Ready To Be Logical! 1. Books and notebooks out. 2. Supplies ready to go. 3. Answer the following: The sum of 2 positive integers is ___________ True.
Proof Techniques and Recursion. Proof Techniques Proof by induction –Step 1: Prove the base case –Step 2: Inductive hypothesis, assume theorem is true.
1 Intro to Induction Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
CSE115/ENGR160 Discrete Mathematics 02/01/11
CMSC 250 Discrete Structures Exam #1 Review. 21 June 2007Exam #1 Review2 Symbols & Definitions for Compound Statements pq p  qp  qp  qp  qp  q 11.
Copyright © Zeph Grunschlag,
Methods of Proof Leo Cheung. A Quick Review Direct proof Proof by contrapositive Proof by contradiction Proof by induction.
CSE115/ENGR160 Discrete Mathematics 03/29/11 Ming-Hsuan Yang UC Merced 1.
Methods of Proof & Proof Strategies
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Chapter 2 - Mathematical Review Functions
Methods of Proofs PREDICATE LOGIC The “Quantifiers” and are known as predicate quantifiers. " means for all and means there exists. Example 1: If we.
Discrete Mathematics Tutorial 11 Chin
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
Discrete Maths: Induction/1 1 Discrete Maths Objective – –to introduce mathematical induction through examples , Semester
9.4 Mathematical Induction
Inductive/Dedu ctive Reasoning Using reasoning in math and science.
EXAMPLE 5 Find a counterexample
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
1 1-1 Patterns and Inductive Reasoning Objectives: Define: –Conjectures –Inductive reasoning –Counterexamples Make conjectures based on inductive reasoning.
1.2 Inductive Reasoning. Inductive Reasoning If you were to see dark, towering clouds approaching what would you do? Why?
Mathematical Induction Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Mathematical induction is a legitimate method.
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.
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,
Unit 01 – Lesson 08 – Inductive Reasoning Essential Question  How can you use reasoning to solve problems? Scholars will  Make conjectures based on inductive.
Inverse, Contrapositive & indirect proofs Sections 6.2/6.3.
Types of Proof Lecture 4 Sections 0.4 Wed, Aug 29, 2007.
Mathematical Induction
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.
If-then statements April 4, What is an if-then statement? One of the postulates we looked at earlier stated: If B is between A and C, then AB +
5-5 Indirect Proof. Indirect Reasoning: all possibilities are considered and then all but one are proved false. The remaining possibility must be true.
Introduction to Proofs. The use of Reasoning and Logic in proofs Inductive Reasoning- “reasoning from detailed facts to general principles” – Specific.
Lecture 1.5: Proof Techniques CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren 1.
Using Inductive Reasoning to Make Conjectures Geometry Farris 2015.
EXAMPLE 3 Write an indirect proof Write an indirect proof that an odd number is not divisible by 4. GIVEN : x is an odd number. PROVE : x is not divisible.
Section 9.4 – Mathematical Induction Mathematical Induction: A method to prove that statements involving natural numbers are true for all natural numbers.
Holt McDougal Geometry 2-1 Using Inductive Reasoning to Make Conjectures 2-1 Using Inductive Reasoning to Make Conjectures Holt Geometry Warm Up Warm Up.
Mathematical Induction. The Principle of Mathematical Induction Let S n be a statement involving the positive integer n. If 1.S 1 is true, and 2.the truth.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
1 Proofs by Counterexample & Contradiction There are several ways to prove a theorem:  Counterexample: By providing an example of in which the theorem.
Chapter 1 Logic and Proof.
11.7 – Proof by Mathematical Induction
Find the lower and upper quartiles for the data set.
CSE15 Discrete Mathematics 02/01/17
CSE15 Discrete Mathematics 03/22/17
Mathematical Preliminaries
Direct Proof by Contraposition Direct Proof by Contradiction
Methods of Proof CS 202 Epp, chapter 3.
Methods of Proof A mathematical theorem is usually of the form pq
2.2 Analyze Conditional Statements
Patterns and Inductive Reasoning
PROOF BY CONTRADICTION
Section 2.1 Proof Techniques Introduce proof techniques:   o        Exhaustive Proof: to prove all possible cases, Only if it is about a.
Mathematical Induction
Quiz 1, Monday 1/28/19 Chapters 1,2 and 3 HW assignments 1-5.
Dr. Halimah Alshehri MATH 151 Dr. Halimah Alshehri Dr. Halimah Alshehri.
Proof by Induction L.O. All pupils understand proof by induction
Mathematical Induction
(c) Project Maths Development Team 2011
Given: the cost of two items is more than $50.
CSE 321 Discrete Structures
11.4 Mathematical Induction
Presentation transcript:

1 Review for Quiz 1

2 Summations

3 Binomial expansion

Bounding sums Upper bound: Any sum is at most the number of terms times the maximum term – Example: n 2 is at most n*n 2 = n 3 Lower bound: If the terms are non-negative, any sum is at least half the number of terms times the median term – Example: n 2 is at least (n/2)*(n/2) 2 = n 3 /8 4

5 Proving (or disproving) p→q Counterexample (used to prove that p→q is false showing one particular choice of p that makes q false) Direct proof (p→p 1 →…→p n →q ) Contrapositive (prove that ~q→~p) Contradiction (assume p and ~q true, find a contradiction) Induction (prove base case + induction)

6 Induction proof using induction