3. Prove that for each natural number n, 十2 ...

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter8: Sequences, Series, And Probability
Section8.5: Mathematical Induction
Problem 42E
icon
Related questions
icon
Concept explainers
Topic Video
Question
#17
W. Prove that for each natural number n, + ++.+ = 2- .
Now consider 13+ 23 +33+... +k + (k+1) +11+1+D.
+ (k + 1) .
(k+1)(k+1+
We know that we can write this as
k (k+1)2
4(k+1)*
4.
Furthermore 4k1)+ (k+ 1) = 4Y
(k+1) (k2+4k+4)
(k+1) (+4(k+1))
(k+1) (k+2)?
(k+1)(k+1+1)
Therefore BPMI. the statement is true for all natural numbers. .
For problems 5 through 9, determine whether or not induction is an option as
uethod of proof for the given statement. Note: You don't have to see if
the inductive argument actually works, just state whether or not the statement
rafiects the type of question for which induction would be an option.
5. If n is any integer, then 8 divides 5" +2.3n-1+1.
6. If n is a positive integer, then 2"> n2.
7. For every integer n 2 1, 1(1!) +2(2!) + ..
+n(n!) = (n+ 1)! – 1.
8. If n is an integer, then n² +n+1 is odd.
9. If r is a real number, then vr2 >r.
Now we ask that you try to construct some induction proofs on your own:
30. Prove that for any integer n,n 2 1, n° + 5n +6 is divisible by 3.
11. Prove that for any natural number n, 2+5+8+.. + (3n –1) =D
n(3n+1)
2
12. Prove that for any natural number n, 5"
- 1 is divisible by 4.
B. Prove that for every natural number n, 2°+2'+...+2"
2n+1-1.
%3D
4. Prove that for any natural number n, 7|(9"- 2").
Prove that for each natural number n, 5 + t..+
%3D
4n+1
Prove that for each natural number n, 21| (4"+l+52n-1).
n+2
ER, f 1. Prove that for any natural number n,
+ ..+ "
n+1
Transcribed Image Text:W. Prove that for each natural number n, + ++.+ = 2- . Now consider 13+ 23 +33+... +k + (k+1) +11+1+D. + (k + 1) . (k+1)(k+1+ We know that we can write this as k (k+1)2 4(k+1)* 4. Furthermore 4k1)+ (k+ 1) = 4Y (k+1) (k2+4k+4) (k+1) (+4(k+1)) (k+1) (k+2)? (k+1)(k+1+1) Therefore BPMI. the statement is true for all natural numbers. . For problems 5 through 9, determine whether or not induction is an option as uethod of proof for the given statement. Note: You don't have to see if the inductive argument actually works, just state whether or not the statement rafiects the type of question for which induction would be an option. 5. If n is any integer, then 8 divides 5" +2.3n-1+1. 6. If n is a positive integer, then 2"> n2. 7. For every integer n 2 1, 1(1!) +2(2!) + .. +n(n!) = (n+ 1)! – 1. 8. If n is an integer, then n² +n+1 is odd. 9. If r is a real number, then vr2 >r. Now we ask that you try to construct some induction proofs on your own: 30. Prove that for any integer n,n 2 1, n° + 5n +6 is divisible by 3. 11. Prove that for any natural number n, 2+5+8+.. + (3n –1) =D n(3n+1) 2 12. Prove that for any natural number n, 5" - 1 is divisible by 4. B. Prove that for every natural number n, 2°+2'+...+2" 2n+1-1. %3D 4. Prove that for any natural number n, 7|(9"- 2"). Prove that for each natural number n, 5 + t..+ %3D 4n+1 Prove that for each natural number n, 21| (4"+l+52n-1). n+2 ER, f 1. Prove that for any natural number n, + ..+ " n+1
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

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
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning