# Lecture_11 - MA1100 Lecture 11 Mathematical Induction Axiom...

This preview shows pages 1–9. Sign up to view the full content.

1 MA1100 Lecture 11 Mathematical Induction Axiom of Induction Principle of Mathematical Induction Base Case Inductive Step

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
MA1100 Lecture 11 2 Example 1 Cardinality of power set Let A be a finite set with n element. How many elements does P (A) have? |A| 1 2 3 | P (A)| A = {a} P (A) = { « , {a} } P (A) = { « , {a}, {b}, {a, b} } A = {a, b, c} P (A) = { « , {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c} } A = {a, b}
MA1100 Lecture 11 3 Example 2 Regions in a circle Place n points on a circle and connect each pair of points with a line. Count the number of distinct regions partitioned by the lines. Number of points 2 3 4 Number of regions

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
MA1100 Lecture 11 4 Example 2 Number of points 2 3 4 5 6 Number of regions Regions in a circle
MA1100 Lecture 11 5 Axiom of Induction If T is a subset of Z + such that: 1. 1 œ T 2. for every k œ Z + , if k œ T, then k+1 œ T then T = Z + This is called the Axiom of Induction T 1 k œ T Ø k+1 œ T Z + = +

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
MA1100 Lecture 11 6 Axiom of Induction If T is a subset of Z such that: 1. 1 œ T 2. for every k œ Z , if k œ T, then k+1 œ T then T = Z Z does not have a smallest number does not hold Counter-example: T = {-1, 0, 1, 2, 3, …} Axiom of Induction is a characteristic of Z + It does not hold for Z.
MA1100 Lecture 11 7 Principle of Mathematical Induction Let P(n) be a predicate such that: 1.P(1) is true 2.For all k œ Z + , if P(k) is true, then P(k+1) is true Then P(n) is true for all n œ Z + Theorem (Principle of Mathematical Induction) Proof Given P(1) is true Given: If P(k) is true, then P(k+1) is true Let T be the set: T = {n œ Z + | P(n) is true} P(n) is true for all n œ Z +

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
MA1100 Lecture 11 8 Principle of Mathematical Induction PMI can be used to prove ( " n œ Z + ) P(n) is true Base Case: Prove P(1) is true Inductive Step: Prove ( " k œ Z + ) P(k) Ø P(k+1) is true inductive hypothesis We can then conclude that P(n) is true for all n œ Z +
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern