For any natural number n, prove the validity of given series by mathematical induction:
2(n+1−1)<1+(21)+...+(n1)<2n Let P(n) be the proposition that for the first n positive integers
2(n+1−1)<1+(21)+...+(n1)<2n BASIS STEP: P(1) is true, because
2(1+1−1)<1<21
2(2−1)<1<2INDUCTIVE STEP: For the inductive hypothesis we assume that P(k) holds for an arbitrary positive integer k. That is, we assume that
2(k+1−1)<1+(21)+...+(k1)<2k Under this assumption, it must be shown that P(k+1) is true, namely, that
2((k+1)+1−1)<1+(21)+...+(k1)
+(k+11)<2k+1 We have that
2(k+1−1)+(k+11)<1+(21)+...+(k1)+(k+11)
<2k+(k+11) Show that
2(k+2−1)<2(k+1−1)+(k+11)
2(k+2−k+1)<k+11
k+1+k+22(k+2−k−1)<k+11
k+1+k+22<k+11
k+1+k+22<k+1+k+12=k+11, True for k≥1.
Show that
2k+(k+11)<2k+1
k+k+12(k+1−k)>k+11
k+k+12>k+11
k+k+12>k+1+k+12=k+11True for k≥1.
We show that P(k+1) is true under the assumption that P(k) is true. This completes the inductive step.
We have completed the basis step and the inductive step, so by mathematical induction we know that P(n) is true for all positive integers n.
That is, we have proven that for any natural number n,
2(n+1−1)<1+(21)+...+(n1)<2n
Comments