Lemma 14.11 Let Sn = integer n. n k=1 = 1+ 712 1 n · + −, where n € N. Then S2 ≥ 1+ n for every positive

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

Could you please elaborate the following proof more? I understand the basis step, and I get what we're trying to proof in the induction step, my problem is the highlighted part, things are being added and substituted and I have no idea where they come from, could you please explain in detail what they are doing in these steps, what steps they're taking? I want to understand this exact proof

Lemma 14.11 Let Sn =
integer n.
Proof
n
k=1
= 1+
1
1
n
+-, where ne N. Then S2 ≥1+ for every positive
2
n
We proceed by induction. For n = 1, $₂¹ = 1 + and so the result holds for n = 1.
1
2
k
, where ke N. We show that S₂k+1 ≥ 1+
Assume that s₂k ≥ 1+
that
2
$2k+1 = 1+
1
2
= $₂k +
≥ S₂k +
= S₂k +
+
1
2k + 1
1
2k+1
2k
2k+1
1
2k+1
1
2k +2
1
2k+1
+
+
+
S2k +
k 1
≥1+=+ =1+
2 2
+
1
+
2
k + 1
2
+
1
2k+1
1
ok+1
By the Principle of Mathematical Induction, S2″ ≥1+
integer n.
n
IN
k+1
2
Now observe
for every positive
Transcribed Image Text:Lemma 14.11 Let Sn = integer n. Proof n k=1 = 1+ 1 1 n +-, where ne N. Then S2 ≥1+ for every positive 2 n We proceed by induction. For n = 1, $₂¹ = 1 + and so the result holds for n = 1. 1 2 k , where ke N. We show that S₂k+1 ≥ 1+ Assume that s₂k ≥ 1+ that 2 $2k+1 = 1+ 1 2 = $₂k + ≥ S₂k + = S₂k + + 1 2k + 1 1 2k+1 2k 2k+1 1 2k+1 1 2k +2 1 2k+1 + + + S2k + k 1 ≥1+=+ =1+ 2 2 + 1 + 2 k + 1 2 + 1 2k+1 1 ok+1 By the Principle of Mathematical Induction, S2″ ≥1+ integer n. n IN k+1 2 Now observe for every positive
Expert Solution
steps

Step by step

Solved in 4 steps with 4 images

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

I really only need the highlighted part explained, if you could explain how they take the steps as in the highlighted part, im new to proofs.

Solution
Bartleby Expert
SEE SOLUTION
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,