BaSIC Math Reviews.

Slides:



Advertisements
Similar presentations
Week 5 - Friday.  What did we talk about last time?  Sequences  Summation and production notation  Proof by induction.
Advertisements

1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
Induction Sections 41. and 4.2 of Rosen Fall 2008 CSCE 235 Introduction to Discrete Structures Course web-page: cse.unl.edu/~cse235 Questions:
Recursive Definitions Rosen, 3.4. Recursive (or inductive) Definitions Sometimes easier to define an object in terms of itself. This process is called.
1 Intro to Induction Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Discrete Structures Chapter 2 Part B Mathematical Induction
1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
CSE115/ENGR160 Discrete Mathematics 03/22/12 Ming-Hsuan Yang UC Merced 1.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 12 Number theory Mathematical induction Proof by induction Examples.
Discrete Structures Chapter 5: Sequences, Mathematical Induction, and Recursion 5.2 Mathematical Induction I [Mathematical induction is] the standard proof.
Chapter 10 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Mathematical Induction.
Module #1 - Logic 1 Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank. Modified By Mingwu Chen Induction.
1 Section 3.3 Mathematical Induction. 2 Technique used extensively to prove results about large variety of discrete objects Can only be used to prove.
1 Strong Mathematical Induction. Principle of Strong Mathematical Induction Let P(n) be a predicate defined for integers n; a and b be fixed integers.
Mathematical Induction
1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Mathematical Maxims and Minims, 1988
Sequences and Series (T) Students will know the form of an Arithmetic sequence.  Arithmetic Sequence: There exists a common difference (d) between each.
Sequences and Series By: Olivia, Jon, Jordan, and Jaymie.
Lecture 9. Arithmetic and geometric series and mathematical induction
Chapter 6 Mathematical Induction
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
CSNB143 – Discrete Structure Topic 5 – Induction Part I.
1 Introduction to Abstract Mathematics Chapter 4: Sequences and Mathematical Induction Instructor: Hayk Melikya 4.1- Sequences. 4.2,
INDUCTION AND RECURSION. PRINCIPLE OF MATHEMATICAL INDUCTION To prove that P(n) is true for all positive integers n, where P(n) is a propositional function,
Math Review Data Structures & File Management Computer Science Dept Va Tech July 2000 ©2000 McQuain WD 1 Summation Formulas Let N > 0, let A, B, and C.
9.4 Mathematical Induction
Module #13: Inductive Proofs Rosen 5 th ed., § inference of a generalized conclusion from particular instances 2. mathematical demonstration of the.
Section 3.3: Mathematical Induction Mathematical induction is a proof technique that can be used to prove theorems of the form:  n  Z +,P(n) We have.
Chapter 1: Introduction
October 3, 2001CSE 373, Autumn Mathematical Background Exponents X A X B = X A+B X A / X B = X A-B (X A ) B = X AB X N +X N = 2X N 2 N +2 N = 2 N+1.
Inductive Proofs and Inductive Definitions Jim Skon.
1 CMSC 341 Math Review. 2 Exponents Identities (X A ) B = X AB X A * X B = X A+B X A / X B = X A-B X A + X B  X A+B.
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
1 Discrete Mathematical Mathematical Induction ( الاستقراء الرياضي )
Mathematical Induction
Chapter 5 With Question/Answer Animations 1. Chapter Summary Mathematical Induction - Sec 5.1 Strong Induction and Well-Ordering - Sec 5.2 Lecture 18.
Mathematical Induction EECS 203: Discrete Mathematics Lecture 11 Spring
Mathematical Induction And Recursion Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Fall 2002CMSC Discrete Structures1 Chapter 3 Sequences Mathematical Induction Recursion Recursion.
1 Mathematical Induction. 2 What is induction? A method of proof It does not generate answers: it only can prove them Three parts: Base case(s): show.
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.
Discrete Mathematics Lecture 6
Advanced Algorithms Analysis and Design
CSE 311 Foundations of Computing I
CSE 311 Foundations of Computing I
Chapter 3 The Real Numbers.
CSE 311: Foundations of Computing
Methods of Proof A mathematical theorem is usually of the form pq
Mathematical Induction Recursion
Notes 9.5 – Mathematical Induction
CSE 311: Foundations of Computing
Exercise Use mathematical induction to prove the following formula.
Follow me for a walk through...
CSE 373 Data Structures and Algorithms
Applied Discrete Mathematics Week 9: Integer Properties
CMSC 341 Math Review.
Follow me for a walk through...
Induction Chapter
Advanced Analysis of Algorithms
Chapter 11: Further Topics in Algebra
Mathematical Induction
Mathematical Induction
Follow me for a walk through...
INDICES AND LOGARITHMS
Copyright © Cengage Learning. All rights reserved.
11.4 Mathematical Induction
Recursion.
Presentation transcript:

BaSIC Math Reviews

Math Reviews Mathematical Induction Logarithm Mod Series Derivative Limit

Mathematical Induction What is Mathematical induction? A method of proving statements defined for the class of positive integers (or some subset of this class) Proof of a predicate Let P(n) be a predicate defined for integers n, and let a be a fixed integer. Motivation

Mathematical Induction Principle of mathematical induction: 1.Basis Step. Show that P(a) is true. 2.Inductive Step. First, the inductive hypothesis is made - we assume P(k) is true, k > a. Then, using this assumption, we show that P(k+1) must also be true. More formally, we prove the implication, P(k) → P(k+1) for all k > a. If we prove both parts of the definition, we have shown that P(n) is true for all n > a.

Mathematical Induction Example: Prove: 1+4+7…+(3n-2)=(3n2-n)/2

Generalized Mathematical Induction Let P(n) be a predicate defined for integers n, and let a and b be fixed integers with a < b. A proof by generalized mathematical induction has two steps, just like regular induction: Basis Step. Show that P(a), P(a+1), P(a+2), ... , and P(b) are all true. Inductive Step. Show that for any integer k, k > b, if we assume P(i) is true for all integers i with a < i < k (this is the inductive hypothesis), P(k) must also be true. In logical notation the inductive step is: P(a) & P(a+1) & P(a+2) & ... & P(k-1) -> P(k). If a = b, this will be changed to regular induction.

Generalized Mathematical Induction Example: Consider the Fibonacci number: 0,1,1,2,3,5,8,13,21,... Fn=Fn-1+Fn-2 with seed values F0=0, F1=1 Prove:

Logarithm logax = y ↔ ay = x Examples: Properties Log x to base a is y means a raised to the y-th power is x. Examples: log28 = 3, log39 = 2, log1010 = 1, log51 = 0 Properties

Mod m mod n = m – lowerbound(m/n) 9 mod 2 = 1 8 mod 3 = 2

Series Arithmetic series Geometric series Harmonic series 1,3,5,7,… 2,5,8,11,… Geometric series 2,6,18,54,… 1,4,16,64,… Harmonic series 1,1+1/2,1+1/2+1/3,1+1/2+1/3+1/4,…

Derivative The rate of change… Consider a uniform acceleration: a – acceleration. t – time. D – displacement. D = ½ at2 V – velocity. V = at Properties ( c * f(x) )’ = c * f’(x) …

Limit Definition: Properties L’Hopital’s Rule