Let Zo(0,1,2,...). Order 7 of the following sentences so that they form a proof for the following statment Choose from these sentences: Then k=3(a+1)+7b, so the statement is also true when nk We use strong induction on n. Since 12k-3

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
Let Zo=(0,1,2,...} Order 7 of the following sentences so that they form a proof for the following statment
Choose from these sentences:
Then k=3(a+1)+7b, so the statement is also
true when nk
We use strong induction on n
Since 12k-3<k, by the induction
hypothesis we have k-3-3a+ 7b for some
a,b € Z₂o
Vnab((n ≥ 12)→ (n = 3a +76)), where the domain of discourse is Z₂0 x Z₂0 x Zo
Now we will show that the statement is true for the
case n k
For the basis step, if n= 12, 13, 14, then the
statement is true because 12-3-4+7-0.
13-3-2+7-1, and 14-3.0+7.2
By the induction hypothesis, we obtain that n is a
multiple of 3 or 7
For the inductive step, let k 2 15 and assume that
the statement is true for all integers n with
12 ≤n<k
We use induction on a
For the basis case, it a-0, we have
n-3.0+7b7b
By the strong induction the statement is true for all
n212
Your Proof
Transcribed Image Text:Let Zo=(0,1,2,...} Order 7 of the following sentences so that they form a proof for the following statment Choose from these sentences: Then k=3(a+1)+7b, so the statement is also true when nk We use strong induction on n Since 12k-3<k, by the induction hypothesis we have k-3-3a+ 7b for some a,b € Z₂o Vnab((n ≥ 12)→ (n = 3a +76)), where the domain of discourse is Z₂0 x Z₂0 x Zo Now we will show that the statement is true for the case n k For the basis step, if n= 12, 13, 14, then the statement is true because 12-3-4+7-0. 13-3-2+7-1, and 14-3.0+7.2 By the induction hypothesis, we obtain that n is a multiple of 3 or 7 For the inductive step, let k 2 15 and assume that the statement is true for all integers n with 12 ≤n<k We use induction on a For the basis case, it a-0, we have n-3.0+7b7b By the strong induction the statement is true for all n212 Your Proof
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
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,