Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
Arrange the steps in the correct order to prove that 21 divides 4n+1+52n-1 whenever n is a positive integer. Rank the options below. 4-4(k+1)+(4+21). 52k-1=4(4(k+1)+52k-1)+21.52k-1 Hence, 211 (4(k+1)+1+52(k+1)-1), and by mathematical induction, 211 (4+1 +52n-1) whenever n is a positive integer. As 21141+1+52-1-1=21, the basis step true. For the inductive hypothesis, suppose that 21 | (4k+1+52k-1). 4-4(k+1)+25-52k-1=4.4(k+1)+(4+21). 52k-1 4(+1)+1+52(k+1)-1=4.4(k+1)+25.52k-1 The term 4(4(k+1)+52k-1) is divisible by 21 according to the inductive hypothesis, and the term 21-52k-1 is clearly divisible by 21. ་

Arrange the steps in the correct order to prove that 21 divides 4n+1+52n-1 whenever n is a positive integer. Rank the options below. 4-4(k+1)+(4+21). 52k-1=4(4(k+1)+52k-1)+21.52k-1 Hence, 211 (4(k+1)+1+52(k+1)-1), and by mathematical induction, 211 (4+1 +52n-1) whenever n is a positive integer. As 21141+1+52-1-1=21, the basis step true. For the inductive hypothesis, suppose that 21 | (4k+1+52k-1). 4-4(k+1)+25-52k-1=4.4(k+1)+(4+21). 52k-1 4(+1)+1+52(k+1)-1=4.4(k+1)+25.52k-1 The term 4(4(k+1)+52k-1) is divisible by 21 according to the inductive hypothesis, and the term 21-52k-1 is clearly divisible by 21. ་

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

Please help me with these two questions. I am having trouble understanding what to do.

 

Thank you

Arrange the steps in the correct order to prove that 21 divides 4n+1+52n-1 whenever n is a positive integer. Rank the options below. 4-4(k+1)+(4+21) - 52k-1 = 4(4(k+1)+52k-1)+21.52k-1 Hence, 211 (4(k+1)+1+52(k+1) - 1), and by mathematical induction, 211 (4+1 + 52n-1) whenever n is a positive integer. As 21141+1+52-1-1=21, the basis step is true. For the inductive hypothesis, suppose that 21 | (4k+1+52k-1). 4.4(k+1)+25.52k-1=4.4(k+1)+(4+21). 52k-1 4(k+1)+1+52(k+1)-1=4.4(k+1)+25.52k-1 The term 4(4(k+1)+52k-1) is divisible by 21 according to the inductive hypothesis, and the term 21.52k-1 is clearly divisible by 21.
Transcribed Image Text:Arrange the steps in the correct order to prove that 21 divides 4n+1+52n-1 whenever n is a positive integer. Rank the options below. 4-4(k+1)+(4+21) - 52k-1 = 4(4(k+1)+52k-1)+21.52k-1 Hence, 211 (4(k+1)+1+52(k+1) - 1), and by mathematical induction, 211 (4+1 + 52n-1) whenever n is a positive integer. As 21141+1+52-1-1=21, the basis step is true. For the inductive hypothesis, suppose that 21 | (4k+1+52k-1). 4.4(k+1)+25.52k-1=4.4(k+1)+(4+21). 52k-1 4(k+1)+1+52(k+1)-1=4.4(k+1)+25.52k-1 The term 4(4(k+1)+52k-1) is divisible by 21 according to the inductive hypothesis, and the term 21.52k-1 is clearly divisible by 21.
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: 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)). INDUCTIVE STEP: 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) Suppose that 3 | (k³ + 2k). (k+1)3 + 2(k+1) = (k³ + 3k² + 3k+ 1) + (2k + 2) = (k³ +2k)+3(k²+k+1) By the inductive hypothesis, 3 | (k³ + 2k), and certainly 3 | 3(k² + k + 1). 3|(13+2 1), i.e., 3 | 3, so the basis step is true. Reset
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: 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)). INDUCTIVE STEP: 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) Suppose that 3 | (k³ + 2k). (k+1)3 + 2(k+1) = (k³ + 3k² + 3k+ 1) + (2k + 2) = (k³ +2k)+3(k²+k+1) By the inductive hypothesis, 3 | (k³ + 2k), and certainly 3 | 3(k² + k + 1). 3|(13+2 1), i.e., 3 | 3, so the basis step is true. Reset
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
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,
SEE MORE TEXTBOOKS