following statement. For every integer n 2 1, 3" - 2 is even. g is a proposed proof by mathematical induction for the statement.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

(Discrete Math HW)

Please Check mark the correct boxes

thank you

 

 

A proof by mathematical induction is supposed to show that a given property is true for every integer greater than or equal to an initial value. In order for it to be valid, the property must be true for
the initial value, and the argument in the inductive step must be correct for every integer greater than or equal to the initial value.
Consider the following statement.
For every integer n 2 1, 3'" – 2 is even.
The following is a proposed proof by mathematical induction for the statement.
Since the property is true for n = 1, the basis step is true. Suppose the
property is true for an integer k, where k > 1. That is, suppose that
3K – 2 is even. We must show that 3K + 1 - 2 is even. Observe that
%3D
3k. 3 – 2 = 3k(1 + 2) – 2
(3k – 2) + 3k . 2.
3k + 1
2
Now 3K – 2 is even by inductive hypothesis, and 3K · 2 is even by
inspection. Hence the sum of the two quantities is even by
(Theorem 4.1.1). It follows that 3* + - - 2 is even, which is what we
needed to show.
Identify the error(s) in the proof. (Select all that apply.)
3k + 1
- 2 + (3k – 2) + 3k . 2
The inductive hypothesis is assumed to be true.
The property is not true for n = 1.
3k
2 is odd by the inductive hypothesis.
O (3k – 2) + 3k. 2 + 3*(1 + 2) – 2
Transcribed Image Text:A proof by mathematical induction is supposed to show that a given property is true for every integer greater than or equal to an initial value. In order for it to be valid, the property must be true for the initial value, and the argument in the inductive step must be correct for every integer greater than or equal to the initial value. Consider the following statement. For every integer n 2 1, 3'" – 2 is even. The following is a proposed proof by mathematical induction for the statement. Since the property is true for n = 1, the basis step is true. Suppose the property is true for an integer k, where k > 1. That is, suppose that 3K – 2 is even. We must show that 3K + 1 - 2 is even. Observe that %3D 3k. 3 – 2 = 3k(1 + 2) – 2 (3k – 2) + 3k . 2. 3k + 1 2 Now 3K – 2 is even by inductive hypothesis, and 3K · 2 is even by inspection. Hence the sum of the two quantities is even by (Theorem 4.1.1). It follows that 3* + - - 2 is even, which is what we needed to show. Identify the error(s) in the proof. (Select all that apply.) 3k + 1 - 2 + (3k – 2) + 3k . 2 The inductive hypothesis is assumed to be true. The property is not true for n = 1. 3k 2 is odd by the inductive hypothesis. O (3k – 2) + 3k. 2 + 3*(1 + 2) – 2
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Area
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,