Advanced Engineering Mathematics
Advanced Engineering Mathematics
10th Edition
ISBN: 9780470458365
Author: Erwin Kreyszig
Publisher: Wiley, John & Sons, Incorporated
Bartleby Related Questions Icon

Related questions

Question

Please help me with this two questions. I am having trouble understanding why the answers are incorrect and what the correct answer is. Please provide the correct answer to the following 2 questions below

Thank you

Arrange the given steps in the correct order to prove that 3" <n! if n is an integer greater than 6, using mathematical induction.
Rank the options below.
Suppose that for some k> 6, 3k <k!
3k+1 = 3.3k
3k+1 < (k+1).k!
For n=7, 37=2187 < 7! = 5040.
3k+1 < (k+1)!
3k+1 < (k+1).3k
to search
X
4
X
2
6
3
X
5
X
< Prev
14 of 16
Next >
E
expand button
Transcribed Image Text:Arrange the given steps in the correct order to prove that 3" <n! if n is an integer greater than 6, using mathematical induction. Rank the options below. Suppose that for some k> 6, 3k <k! 3k+1 = 3.3k 3k+1 < (k+1).k! For n=7, 37=2187 < 7! = 5040. 3k+1 < (k+1)! 3k+1 < (k+1).3k to search X 4 X 2 6 3 X 5 X < Prev 14 of 16 Next > E
Click and drag the steps in the correct order to show that 3 divides n³ + 2n whenever n is a positive integer using mathematical
induction.
BASIS STEP:
31 (13+2 1), i.e., 3 | 3, so the basis step is true.
INDUCTIVE STEP:
Suppose that 3 | (k³ + 2k).
By the inductive hypothesis, 3 | (k³ + 2k), and
certainly 3 | 3(k² + 1).
As the sum of two multiples of 3 is again divisible
by 3, 3 | ((k+1)3 + 2(k + 1)).
31 (03+2 0), i.e., 3 | 0, so the basis step is true.
(k+1)3 + 2(k + 1) = (k³ + 3k² + 1) + (2k + 2) = (k³ +
2k) + 3(k² + 1)
(k+1)3 + 2(k+1) = (k³ + 3k² + 1) + (2k + 2) = (k³ +
2k) + 3(k² + 1)
Suppose that 3 | (k³ + 2k).
By the inductive hypothesis, 3 | (k³ + 2k), and
certainly 3 | 3(k² + k + 1).
As the sum of two multiples of 3 is again divisible
by 3, 3 | ((k+1)3 + 2(k + 1)).
(k+1)3 + 2(k+1) = (k³ + 3k² + 3k+ 1) + (2k + 2) =
(k3 + 2k)+3(k² + k + 1)
By the inductive hypothesis, 3 | (k³ + 2k), and
certainly 3 | 3(k² + k + 1).
31 (13+2 1), i.e., 3 | 3, so the basis step is true.
expand button
Transcribed Image Text:Click and drag the steps in the correct order to show that 3 divides n³ + 2n whenever n is a positive integer using mathematical induction. BASIS STEP: 31 (13+2 1), i.e., 3 | 3, so the basis step is true. INDUCTIVE STEP: Suppose that 3 | (k³ + 2k). By the inductive hypothesis, 3 | (k³ + 2k), and certainly 3 | 3(k² + 1). As the sum of two multiples of 3 is again divisible by 3, 3 | ((k+1)3 + 2(k + 1)). 31 (03+2 0), i.e., 3 | 0, so the basis step is true. (k+1)3 + 2(k + 1) = (k³ + 3k² + 1) + (2k + 2) = (k³ + 2k) + 3(k² + 1) (k+1)3 + 2(k+1) = (k³ + 3k² + 1) + (2k + 2) = (k³ + 2k) + 3(k² + 1) Suppose that 3 | (k³ + 2k). By the inductive hypothesis, 3 | (k³ + 2k), and certainly 3 | 3(k² + k + 1). As the sum of two multiples of 3 is again divisible by 3, 3 | ((k+1)3 + 2(k + 1)). (k+1)3 + 2(k+1) = (k³ + 3k² + 3k+ 1) + (2k + 2) = (k3 + 2k)+3(k² + k + 1) By the inductive hypothesis, 3 | (k³ + 2k), and certainly 3 | 3(k² + k + 1). 31 (13+2 1), i.e., 3 | 3, so the basis step is true.
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Advanced Engineering Mathematics
Advanced Math
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Wiley, John & Sons, Incorporated
Text book image
Numerical Methods for Engineers
Advanced Math
ISBN:9780073397924
Author:Steven C. Chapra Dr., Raymond P. Canale
Publisher:McGraw-Hill Education
Text book image
Introductory Mathematics for Engineering Applicat...
Advanced Math
ISBN:9781118141809
Author:Nathan Klingbeil
Publisher:WILEY
Text book image
Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,
Text book image
Basic Technical Mathematics
Advanced Math
ISBN:9780134437705
Author:Washington
Publisher:PEARSON
Text book image
Topology
Advanced Math
ISBN:9780134689517
Author:Munkres, James R.
Publisher:Pearson,