15. Prove that for each natural number n, s+ (4n-3)(4n+1) 4n+1 ...

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
icon
Concept explainers
Topic Video
Question
#15
et bod of proof Rar the given statement. Nete: You don't have to see if
S throuch 9etermine whether or not induction is an option as
e e argument actwalty wwrks, fust state whether or not the statement
eN Ce type of question fw which induction would be an option.
*EAR any integer, then s divides 5" + 2 3"-+1.
t a positive integer, then 2"> .
Ror every integer n > 1, 1(tD+2(2) + +n(nl) (n+1)!-1.
& If e is an integer, then n+n+1 is odd.
9. 1f is a real number, theu vr r.
Now we ask that you try to construct some induction proofs on your own:
10 Prove that for any intesger n,n> 1, n+5n +6 is divisible by 3.
n(3n+1)
2.
11. Prove that for any natural number n, 2+5+8+...+(3n-1)=
12. Prove that for any natural number n, 5-1 is divisible by 4.
2n+1 1.
13. Prove that for every natural number n, 20 +2+..+2"=
14. Prove that for any natural number n, 7|(9" - 2").
15. Prove that for each natural number n, t+...+
%3D
(4n-3)(4n+1)
4n+1
16. Prove that for each natural number n, 21 (4"+1 +52n-1).
n+2
17. Prove that for each natural number n, + ++.. +* = 2 - .
18 Let re R.r 1. Prove that for any natural number n,
1+r+r+ + = S.
%3D
Transcribed Image Text:et bod of proof Rar the given statement. Nete: You don't have to see if S throuch 9etermine whether or not induction is an option as e e argument actwalty wwrks, fust state whether or not the statement eN Ce type of question fw which induction would be an option. *EAR any integer, then s divides 5" + 2 3"-+1. t a positive integer, then 2"> . Ror every integer n > 1, 1(tD+2(2) + +n(nl) (n+1)!-1. & If e is an integer, then n+n+1 is odd. 9. 1f is a real number, theu vr r. Now we ask that you try to construct some induction proofs on your own: 10 Prove that for any intesger n,n> 1, n+5n +6 is divisible by 3. n(3n+1) 2. 11. Prove that for any natural number n, 2+5+8+...+(3n-1)= 12. Prove that for any natural number n, 5-1 is divisible by 4. 2n+1 1. 13. Prove that for every natural number n, 20 +2+..+2"= 14. Prove that for any natural number n, 7|(9" - 2"). 15. Prove that for each natural number n, t+...+ %3D (4n-3)(4n+1) 4n+1 16. Prove that for each natural number n, 21 (4"+1 +52n-1). n+2 17. Prove that for each natural number n, + ++.. +* = 2 - . 18 Let re R.r 1. Prove that for any natural number n, 1+r+r+ + = S. %3D
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Application of Algebra
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,