What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n + 4. 3.Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd.

Slides:

Advertisements

Similar presentations

Is it rational or irrational?

Advertisements

The Legend has come....

The Comparison Test Let 0 a k b k for all k.. Mika Seppälä The Comparison Test Comparison Theorem A Assume that 0 a k b k for all k. If the series converges,

Tutorial 2: First Order Logic and Methods of Proofs

Consecutive Integers Consecutive Integers are integers that follow one after another. Example 1: are consecutive integers.

THE WELL ORDERING PROPERTY Definition: Let B be a set of integers. An integer m is called a least element of B if m is an element of B, and for every x.

Mathematical Induction

Lesson 10.4: Mathematical Induction

PROOF BY CONTRADICTION

Review for CS1050. Review Questions Without using truth tables, prove that  (p  q)   q is a tautology. Prove that the sum of an even integer and an.

If R = {(x,y)| y = 3x + 2}, then R -1 = (1) x = 3y + 2 (2) y = (x – 2)/3 (3) {(x,y)| y = 3x + 2} (4) {(x,y)| y = (x – 2)/3} (5) {(x,y)| y – 2 = 3x} (6)

Mathematical induction Isaac Fung. Announcement ► Homework 1 released ► Due on 6 Oct 2008 (in class)

More Set Definitions and Proofs 1.6, 1.7. Ordered n-tuple The ordered n-tuple (a1,a2,…an) is the ordered collection that has a1 as its first element,

13.4 Mathematical Induction. Mathematical Induction is a common method of proving that each statement of an infinite sequence of mathematical statements.

Direct Proof and Counterexample II Lecture 12 Section 3.2 Thu, Feb 9, 2006.

1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.

If H is the subgroup in Z 12, then H2 = (a) 5(b) 14 (c) {3, 6, 9, 0}  {2}(d) {5, 8, 11, 2} (e) {5, 6, 9, 0}(f) {3, 2, 5}

A b c d e f g h j i k Graph G is shown. Which of the following is a trail but not a path? 1). acdefhg 2). hfdcbdfe 3). ghfdcbde 4). acdegik 5). None of.

Courtesy Costas Busch - RPI1 More Applications of the Pumping Lemma.

Assume f: A  B and g: B  C are functions. Which are defined? (1) f  g (2) g  f(3) both(4) neither.

How do we start this proof? (a) Assume A n is a subgroup of S n. (b)  (c) Assume o(S n ) = n! (d) Nonempty:

What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.

What is the first line of the proof? 1.If a divides b, then a divides b – c. 2.If a divides b, then a divides c. 3.Assume a divides b – c. 4.Assume a divides.

Proof by Induction and contradiction Leo Cheung. The TAs Our office is in SHB117, feel free to come if you get problems about the course Or ask your questions.

How do we start this proof? (a) Let x  gHg -1. (b)  (c) Assume a, b  H (d) Show Nonempty:

Find all subgroups of the Klein 4- Group. How many are there?

1 More Applications of the Pumping Lemma. 2 The Pumping Lemma: Given a infinite regular language there exists an integer for any string with length we.

Methods of Proof Leo Cheung. A Quick Review Direct proof Proof by contrapositive Proof by contradiction Proof by induction.

Chapter 10 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Mathematical Induction.

Prof. Busch - LSU1 More Applications of the Pumping Lemma.

Proof Methods & Strategy

Reflexive -- First sentence of proof is: (1) Let x  Z (2) Let (x,x)  R. (3) Let (x,x)  I (4) Let x  R.

What is the first line of the backwards direction of this proof? 1.Assume G is a block. 2.Assume every pair of vertices lie on a common cycle. 3.Assume.

(a) (b) (c) (d). What is (1,2,3)  (3,4,2)? (a) (1, 2, 3, 4) (b) (1,2)  (3,4) (c) (1,3,4,2) (d) (3,1)  (4,2)

© 2007 by S - Squared, Inc. All Rights Reserved.

Objective: Learn to multiply and divide integers.

Proofs 1/25/12.

Power of a Product and Power of a Quotient Let a and b represent real numbers and m represent a positive integer. Power of a Product Property Power of.

I CAN COMPARE AND ORDER RATIONAL NUMBERS BY USING A NUMBER LINE. 1.5 RATIONAL NUMBERS.

9.4 Mathematical Induction

13-1 Coloring Regions with Two Colors. Theorem The regions formed by n circles in the plane can be colored with red and blue in such a way that.

Consecutive even/odd Integers

4.8 Polynomial Word Problems. a) Define the variable, b) Write the equation, and c) Solve the problem. 1) The sum of a number and its square is 42. Find.

CONSECUTIVE INTEGERS. CONSECUTIVE INTEGERS - Consecutive integers are integers that follow each other in order. They have a difference of 1 between each.

5-5 Indirect Proof. Indirect Reasoning: all possibilities are considered and then all but one are proved false. The remaining possibility must be true.

OBJECTIVE: TSW SOLVE MULTI-STEP EQUATIONS. SEPTEMBER 21,2011 Lesson 2-3 Multi- Step Equations.

Prove that: odd + odd = even even + even = even odd + even = odd even + odd = odd.

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.

1 Discrete Mathematical Mathematical Induction ( الاستقراء الرياضي )

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.

Multiplying and Dividing Integers

Consecutive Integers.

Mathematical Induction

Countable and Countably Infinite Sets

The sum of any two even integers is even.

2-4 Solving Multi-Step Equations

75 Has 7 in the tens place Odd Number Less than 100

Quadratic Word Problems

Objective - To multiply integers.

Lecture 43 Section 10.1 Wed, Apr 6, 2005

More Applications of the Pumping Lemma

Direct Proof and Counterexample I

Dr. Halimah Alshehri MATH 151 Dr. Halimah Alshehri Dr. Halimah Alshehri.

12 Has 1 in the tens place Even Number Less than 20

Multiplying integers 3(3) = (3) = (3) = (3) = 0 -3

THE WELL ORDERING PROPERTY

6.1 Using Properties of Exponents

Introduction to Proofs

11.4 Mathematical Induction

Presentation transcript:

What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd integer. 6.Assume all odd integers.

What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd integer. 6.Assume all odd integers.

What is the next line of the proof? 1.Then 6n 2 + 5n + 4 is odd. 2.Then 6n 2 + 5n + 4 = 2k + 1 for some integer k. 3.Then n = 2k + 1 for some integer k. 4.Then n = 2k + 1 and 6n 2 + 5n + 4 = 2j + 1 for integers k and j. 5.Then n + 1 is even.