Nama : Mita Sari Halawa

Nim : 17029035

Topic : Mathematical Induction

1. Well-Ordering Property of N

“Every nonempty subset of N has a least elemen”

 If S is a subset of N, and S ≠ Q,then there exist m ∈ S such that m ≤ k ∀ k ≤ S

2. Principle of Mathematical Induction

“ Let S be a subset of N that prossess the properties :

1. 1 ∈ S;

1+1 ∈ S

1+1+1∈ S sehingga S = N

1+1+1+1∈ S

2. if k ∈ S, then k+1 ∈ S

then S = N “

proof :

Andaikan S ≠ N, maka N\S ⊆ N dan N\S ≠ ∅.

Sehingga menurut aturan keteruturan yang baik,

N\S mempunyai elemen terkecil, sebut m , karena m elemen terkecil N\S,maka (m-1) ∉ N\S.

Perhatikan, 1 ∈ S, sehingga m > 1,akibatnya m-1 ∈ N , maka m-1 ∈ S. Dengan sifat kedua di
himpunan S, maka k= m-1 ∈ S, maka k + 1 = (m-1)+1= m ∈ S , tetapi m∈ N\S (kontradiksi).

Jadi haruslah S =N
 Principle of mathematical induction Principle of mathematical induction 2ND
version
For each n∈ N, let P(n) be a steatment For each n∈ N, let P(n) be a steatment for each
about n. Suppose that: natural number n ≥ n0. Suppose that:

(1’) P(1) is true; (1) The steatment P(n0. ) is true.

(2’) if P(k) is true, then P(k + 1) is true. (2) For all k ≥ n0. , the truth of P(k) implies the
truth of P(k+1).
Then P(n) is true for all n∈ N
Then P(n) is tre for all n ≥ n0.

3. Principle of Strong Mathematical Induction

“ Let S be a subset of N such that

(1”) 1∈ S.

{1} ⊆ S  1 + 1 ∈ S

{1,2} ⊆ S  2 + 1 ∈ S

{1,2,3}⊆S  3+1 ∈S

(2”) For every k ∈ N , if {1,2,…,k} ⊆ S, then k + 1 ∈ S.

Then S = N “

EXERCISE
1. Prove that 1/1 · 2 + 1/2 · 3 + · · · + 1/n(n + 1) = n/(n + 1) for all n∈N .

Answer :

1 1 1 n
P(n) = + + …+ =
1.2 2.3 n ( n+1 ) ( n+ 1 )

proof :

 check P(1)
1 1
= sehingga P (1 ) benar
1(1+ 1) 1+ 1
 asumsikan P(n) benar, artinya,
1 1 1 k
+ + …+ =
1.2 2.3 k ( k +1 ) ( k +1 )
 buktikan P(k+1) benar
1 1 1 1
P(k+1) = + + …+ +
1.2 2.3 k ( k +1 ) ( k +1 )( k +1 )+1

¿
( 1.21 + 2.31 +…+ k ( k1+ 1) )+ ( k + 11)( k + 2)
k 1
¿ +
k +1 (k +1)(k +2)
k ( k +2 ) +1
¿
( k +1 ) ( k +2 )
k 2+2 k +1
¿
( k +1 ) ( k +2 )
k +12
¿
( k +1 ) ( k +2 )
k +1 k +1
¿ = (benar)
k +2 ( k +1 ) +1
Jadi P(1) benar, P(k) benar  P(n+1) benar, maka P(n) benar ∀ n ∈ N
 2
1
3 3 3
2. Prove that 1 +2 +…+n = n ( n+1 ) for all n ∈ N
2 [ ]
Answer :

2
1

3 2
observe that 1 =1∧ 1 ( 1+1 ) =(1) =1 ,
2 [ ]
2
1
3
[ ]
then 1 =1∧ 1 ( 1+1 ) the formula holds for n = 1
2
 assume that the formula is true for same k∈ N , P(k+1) is true then we have
2
1
13 +23 +…+ k 3= [ 2
k ( k + 1) ]
2
1
3 3 3
P ( k +1 )=1 +2 +…+ k + ( k +1 ) = k ( k +1 ) +¿.
2
3
[ ]
then observe
2
1
[ 2
k ( k +1 ) +¿ ]
¿¿

k2 4 k 4 (
¿ ( + +
4 4 4
k +1 )
2
)
¿¿¿
1
¿ [ 4
( k +2)2 ( k +1 )2 ]
2
1
[
¿ ( k +1 ) ( k +2 )
2 ]
2
1
¿ [ 2
( k +1 ) ( k +1 ) +1 . ]
2
1
3 3 3 3
Thus, 1 +2 +…+ k + ( k +1 ) = [ 2 ]
( k +1 )( k +1 )+ 1 and therefor the formula holds for n = k

+ 1.
Hence, the formula holds for all n ∈ N
3. Prove that 3+11+ …+ ( 8 n−5 )=4 n2−n for all n∈ N
Answer :
 check P(1)
observe that 8(1) – 5 = 3 dan 4 (1)2−1=3 , which gives us that 8(1) – 5 = 4 (1)2−1 and
there for the formula holds for n = 1.
 assume that the formula is true for some k∈ N ,sehingga P(k=1) benar.
adding 8(k+1) -5 to both sides of the equation
3+11+ …+ ( 8 k −5 )=4 k 2 −k +8 k + 3
¿ 4 k 2 +8 k + 4−k −1
¿ 4 ( k 2 +2 k +1 ) −( k +1 )
¿ 4 ( k +1 )2−( k + 1 ) .
thus,3+11+ …+ ( 8 k −5 ) + ( 8 ( k +1 )−5 )=4 ( k + 1 )2−( k +1 ) and therefor the formula holds for
n=k+1
Hence,the formula holds for all n ∈ N
2 2 2 4 n3 −n
4. Prove that 1 +3 +…+ 2 n−1 =
( ) for all n ∈ N
3
Answer :
1∧4(1)3−1 4 (1)−1 3 4(1)3−1
 observe that 12= = = =1 , which gives us that 12 =
3 3 3 3
and therefor the formula holds for n = 1.
 Assume that the formula is true for some k ∈ N , so P(k + 1) benar,maka:
2 2 2 4 k 3−k
1 +3 +…+ ( 2 k −1 ) = , adding (2 (k+1) - 12 to both sides of the equation
3

2 2 2 4 k 3−k
1 +3 +…+ 2 k −1 =
( ) give us that ,
3
2 2 2 2 4 k 3−k 2
1 +3 +…+ ( 2 k −1 ) + ( 2 ( k +1 )−1 ) = + ( 2 ( k+ 1 )−1 ) .
3
 Now, observe that
 4 k 3−k 2 4 k 3−k ( 2
+ ( 2 ( k +1 ) −1 ) = + 2 k +2−1 )
3 3
4 k 3−k ( 2
¿ + 2 k +1 )
3
4 k 3−k 2
¿ + 4 k +4 k +1
3
4 k 3−k +12 k 2+12 k +3
¿
3
4 k 3+ 12k 2+12 k + 4−k −1
¿
3
(k ¿ ¿ 3+3 k 2+3 k+ 1)−(k + 1)
¿4 ¿
3
4 (k +1)3−( k +1)
¿
3
3
4 k 3−k 4 (k + 1) −(k +1)
Thus, + (2(k +1)−1)2=
3 3
and therefor the formula holds for n = k + 1.
hence, the formula holds for all n ∈ N
2 2 2 n+1 2 n+ 1 n ( n+1 )
5. Prove that 1 −2 +3 +…+ (−1 ) n =(−1 ) for all n ∈ N
2
Answer :
2 1+1 1 ( 1+ 1 ) 2 1 ( 2 )
 Observe that 1 =1∧( – 1 ) =1 =( 1 ) (1 )=1
2 2
2 1+1 1 ( 1+1 )
so 1 =( – 1 ) ,therefore the formula holds for n = 1
2
 Assume that the formula is true for same k∈ N
P( k + 1) benar,
2 2 2 k+1 2 k +1 k ( k +1 )
then we have that 1 −2 +3 +…+ (−1 ) k =(−1 ) .
2
Adding (−1 )( k+1)+ 1( k +1)2 to both sides of the equation,
give us that,

k ( k +1 )
12−22 +32 +…+ (−1 )k+1 k 2 + (−1 )(k +1)+1 ( k +1 )2=(−1 ) k+1 + (−1 )(k +1)+1 (k +1)2.
2
 Now, observe that
k ( k +1 ) k ( k +1 )
(−1 )k +1 + (−1 )(k+1 )+1 (k +1)2=(−1 )k +1 −(−1 )(k+1) ( k +1)2.
2 2

¿ (−1 )k+ 1 ( k ( k+2 1) −(k + 1) ) 2

( k 2+ k )
¿ (−1 )
k+ 1
( 2
−k 2−2 k−1 )
k 2+ k−2k 2−4 k−2
¿(−1)k +1 ( 2 )
2
¿(−1)k +1 ( −k −32 k −2 )
(k +1)( ( k +1 ) +1)
¿(−1)( k+1) +1 ( 2 )
Therefore the formula holds for n = k + 1
Hence,the formula holds for all n ∈ N .
6. Prove that n3 +5 n is divisible by 6 for all n ∈ N .
Answer:
6
P(n) = 3
n +5 n
proof :
 cek P(1) benar
6
13 +5.1=6 , sehingga 3
1 + 5.1
sehingga P(1) benar.
 AsumsikanP(k) benar,sehingga
6
3 atau k 3+5 k=6 m ,untuk suat u m∈ Z
k +5 k
 Buktikan P(k+1) benar
P(k+1) = (k + 1)3 +5 ¿)
= k 3+3 k 2+ 3 k +1+5 k +5
= (k 3+5 k ¿+ 3 k 2 +3 k +6
= 6m + 3(k 2+ k ¿+6
 = 6m + (k)(k+1)+6
klaim : k(k+1) benar, sehingga ¿
dengan x = k(k+1)/2 ,sehingga P(k+1) benar.
bukti kalim:
k(k+1) ∈ bilangan genap
 k = 1 1.2 ∈ bil . genap
 k = P asumsikan benar
P(P+1) = P2+P genap
maka,
k = P+1
(p+1)(p+2)
= P2 +3 p +2
= P2 +2+2 p+ 2 (genap)

7. Prove that 52 n−1 is divisible by 8 for all n ∈ N .

Answer:
 Observe that 52.1 −1=52−1=25−1=24=8 ( 3 ) ,
which give us that the statement istrue for n=1.
 Assume that the statement is true for some k ∈ N .
then we have, 52 k −1 is divisible by 8and therefore there exist m∈ Z such that
52 k −1=8 m.
 Thus,
52 (k +1)−1=52 k+2−1=52 k (5 )−1=25 ( 5 2k ) −1=25 ( 52 k ) −25+24=25 ( 52 k −1 ) + 24=24 ( 8 m )+ 8 ( 3 )=8 ( 25 m )−8
which give us that 52 k−1−1 is divisible by 8 and therefore,
Hence, the statement is true for all n ∈ N

8. Prove that 5n −4 n−1 isdivisible by 16 foar all n ∈ N

Answer :
 Observe that 51−4.1−1=5−4−1=0=16 ( 0 ) ,
the statement is true for n=1
  Assume that the statement is true for k ∈ N ,
then, 5k −4 k−1 is divisible by 16 and therefore there exist m ∈ Z
such that, 5k −4 k−1=16 m
 thus,
5k +1−4 ( k +1 )−1
¿ 5k ( 5 )−4 k −4−1
¿ 5(5¿¿ k)−4 k−5−16 k +16 k ¿
¿ 5(5¿ ¿ k)−20 k−5−16 k ¿
¿ 5 ( 5k −4 k−1 ) +16 k
¿ 5 ( 16 m )+16 k
¿ 16 ( 5 m )+16 k
¿ 16 ( 4 m+ k ) wich give us that 5k +1−4 ( k +1 )−1 is divisible by 16
Hence, the statement is true for all n ∈ N .

9. Prove that n3 +( n+1 )3+( n+2 )3 is divisible by 9 for all n ∈ N .

Anwer :
 Observe that 13+( 1+1 )3+( 1+2 )3=13+23+33=36=9 ( 4 ) ,
the statement is true for all n ∈ N
 Assume that the statement is true for some k ∈ N
then we have,
3 3
k 3+( k +1 ) +( k + 2 ) is divisible by 9 and therefore there exist m∈ Z
such that,
3 3
k 3+( k +1 ) +( k + 2 ) =9 m
 thus,
3 3 3
¿ ( k +1 ) + ( ( k +1 )+ 1 ) + ( ( k +1 ) +2 )
3 3 3
¿ ( k +1 ) + ( k + 2 ) + ( k +3 )
= ( k +1 )3 + ( k +2 )3+k 3+9 k 2+27k+27
= k 3+ ( k +1 )3+ ( k +2 )3+9 k 2+27 k +27
= 9m+9 ( k 2+3k+3)
 = 9(m+k 2+3k+3)
3 3 3
which gives us that ( k +1 ) + ( ( k +1 ) +1 ) + ( ( k +1 ) +2 ) is divisible by 9 and therefore,the
statement is true for n = k+1
Hence, the statement is true for all n ∈ N .

10. Conjecture a formula for the sum 1/1 · 3 + 1/3 · 5 + · · · + I/(2n -1) (2n + 1), and prove
your conjecture by using Mathematical Induction.
Answer:
 Observe that
1 1 1
= =
1.3 3 2 ( 1 )+ 1
1 1 1 1 6 2 2
+ = + = = = ,
1.3 3.5 3 15 15 5 2 ( 2 ) +1
1 1 1 2 1 15 3 3
+ + = + = = =
1.3 3.5 5.7 5 35 35 7 2 (3 )+ 1
1 1 1 1 3 1 28 4 4
+ + + = + = = =
1.3 3.5 5.7 7.9 7 63 63 9 2 ( 4 ) +1
Thus we have can conjecture that 1/1 · 3 + 1/3 · 5 + · · · + I/(2n -1) (2n + 1) =
n/2n+1 for all n ∈ N
 consider,
1 1 1 n
+ + …+ = for all n ∈ N
1.3 3.5 ( 2n−1 ) ( 2n+1 ) ( 2 n+1 )
1 1 1
since, = = we have the statement is true for n=1
1.3 3 2 ( 1 )+ 1
 Assume the statement is true for k ∈ N , then we have that
1 1 1 k
+ + …+ =
1.3 3.5 ( 2 k−1 ) ( 2 k +1 ) ( 2 k +1 )
1
Adding ¿ ¿ both sides of the equation
( 2 ( k +1 )−1 ) ( 2 k +1 ) +1¿
1 1 1 k
+ + …+ =
1.3 3.5 ( 2 k−1 ) ( 2 k +1 ) ( 2 k +1 )
give us that,
 1 1 1 1 k 1
+ + …+ + ¿= + ¿
1.3 3.5 ( 2 k−1 ) ( 2 k +1 ) ( 2 ( k +1 )−1 ) ( 2 k +1 ) +1 ¿ ( 2 k +1 ) ( 2 ( k +1 )−1 ) ( 2 k +1 ) +1¿
thus since,
k 1
+ ¿
( 2 k+ 1 ) ( 2 ( k +1 )−1 ) ( 2 k +1 ) +1 ¿
k 1
¿ +
( 2k + 1 ) ( 2 k +2−1 ) ( 2 k +2+1 )
k 1
¿ +
( 2k + 1 ) ( 2 k +1 )( 2 k +3 )
k ( 2 k +3 ) 1
= +
( 2 k+ 1 )( 2 k +3 ) ( 2 k +1 )( 2 k +3 )
2 k 2 +3 k +1
=
( 2 k+ 1 )( 2 k +3 )
(2 k +1)(k +1)
=
( 2 k+ 1 )( 2 k +3 )
( k +1)
=
( 2 k+ 3 )
(k +1)
= we have that
( 2 ( k +1 ) +1 )
1 1 1 1 (k +1)
+ + …+ + ¿=
1.3 3.5 ( 2 k−1 ) ( 2 k +1 ) ( 2 ( k +1 )−1 ) ( 2 k +1 ) +1 ¿ ( 2 ( k +1 ) +1 )
and therefore the statement is true for n = k + 1
1 1 1 n
hence, + + …+ = for all n ∈ N
1.3 3.5 ( 2n−1 ) ( 2n+1 ) ( 2 n+1 )

11. Conjecture a formula for the sum of the first n odd natural numbers
1 + 3 + · · · + (2n - 1 ), and prove your formula by using Mathematical Induction.
answer :
 Observe that
1 = 12
1+3 = 4 =22
1+3+5 = 9 = 32
1+3+5+7 = 16 = 4 2
 Thus we can conjecture that 1 + 3 + 5 + 7 +…+(2n-1) = n2 for all n ∈ N
 Consider ,
1 + 3 + 5 + 7 +…+(2n-1) = n2 for all n ∈ N
since, 1 = 2(1)-1 =12, we have that the statement is true for n = 1.
 Assume the statement is true for k ∈ N the we have 1 + 3 + 5 + 7 +…+(2k-1) = k 2
 adding (2(k+1) to both sides of the equation
1 + 3 + 5 + 7 +…+(2k-1)+(2(k+1)-1) = k 2+(2 ( k +1 )−1)
 Thus,
since, k 2+ ( 2 ( k + 1 )−1 )=k 2+(2 k +2)−1 ¿=k 2 +2 k +1=(k +1)2
we have that 1 + 3 + 5 + 7 +…+(2k-1)+(2(k+1)-1) = (k + 1)2
its meant, the statement is true for n = k+1
hence, 1 + 3 + 5 + 7 +…+(2n-1) = n2 for all n ∈ N

12. Prove the Principle of Mathematical Induction 1.2.3 (second version).

Answer :

For each n∈ N, let P(n) be a steatment for each natural number n ≥ n0. Suppose that:

(1) The steatment P(n0. ) is true.

(2) For all k ≥ n0. , the truth of P(k) implies the truth of P(k+1).

Then P(n) is tre for all n ≥ n0.

 if n = n0, then by (i) P(n)=P(n0) is true.

 if n > n0, take n = n0 + s, where s ∈ {1,2,3 , … , }
 if we show that P(n-k) is true for k = 1,2,3,…,n- n0-1, then by (ii), P(n) will be true.
 define S = { n0 + t : 1 ≤ t ≤ s−1 , t ∈ N , we want to show that P(q) is true for all q∈ S ;
 P(n0+1) is true by (i),(ii),
consequently,
P((n0+1)+1)= P(n0+2) is true by (ii).
  we have P(n0+ t)is true for all t, 1 ≤ t ≤ s−1
 so, P(q) is true for all q∈ S
This iterations will stop since S is a finite set,so the conclution is justified.ss

13. Prove that n < 2n for all n ∈ N.

Answer :
 Observe that 1<2 = 21 ,the statement is true for n=1 ,
 Assume that, is true for k∈ N
then, k < 2k wich giveus that 2 k <2 ( 2 k )=2k+1.
 Observe for any real number x with 1≤ x we have that x +1 ≤2 x
in particular we have, n+1 ≤ 2n for all n ∈ N
 Thus, k + 1 ≤ 2 k <2 ( 2k )=2k +1, wich give us that k + 1 < 2k +1
the statement is true for n = k +1
Hence, the statement is true for all n ∈ N

14. Prove that 2n < n! for all n ≥ 4 n ∈ N

Answer :
 check P(4)
24 =16<24=4 !
sehingga P(4) benar.
 Assumsikan P(k) benar, maka
2k < k!
buktikan P(k+1) benar,
P(k+1) = 2k+1 = 2. 2k
< 2. k!
karena k≥ 4, maka k+1 > 2
sehingga,
2k+1< 2.k!
<(k+1).k!
<(k+1)!
15. Prove that 2n−3 ≤ 2n−2for all n ≥5, n ∈ N
Answer:
 Observe that for P(5) benar
2(5) – 3 = 10 – 3 = 7 < 8 = 23 = 25-2 , the statement is true for n =5,
 Assume,
for k∈ N with k ≥5 (is true)
sehingga P(k+1) benar,
buktikan :
we have 2k −3≤ 2k−2
give us that 2( k+1) – 3 = 2k + 2 – 3 = (2k-3) + 2 < 2k−2 +2
 observe now that since, 5 ≤ k ,
we have that 3≤k-2
wich give us that 2 < 8 = 23≤ 2k−2 and therefore

2k−2 +2<2k−2 +2k−2=2 ( 2k−2 ) =2k−2+1=2( k+1 )− 2

thus, 2(k+1) – 3 < 2k−2 +2<2( k+1)−2,the statement is true for n = k + 1.
Hence, the statement is true for all n ≥5, n ∈ N

16. Find all natural numbers n such that n2 < 2n. Prove your assertion
Answer :
 look
12=1<2=21
22=4=22 ,
32=9>8=23
4 2=16=24
52=25 <32=25
62 =36<64=26
72 =49<128=27
82 =64<256=28
Thus we can conjecture that n2 < 2n for n = 1 and foe all n ≥5
  consider
since, 52=25 <32=25, the statement is true for n = 5
 Assume
for k∈ N with k ≥5 (is true)
we have k2 < 2k , gives us 2k2 < 2(2)k =2k+1
since, 5≤ k, we have 4 ≤ k−1
so, 2<16 = 42 ≤ ( k−1 )2 =k 2−2 k +1 ,
thus, 2 < k 2−2 k +1 and then 2k+1< k 2, gives us k 2−2 k +1<2 k 2 and therefore ,

( k −1 )2< 2 k 2
thus, ( k −1 )2< 2 k 2< 2(2 k )2=¿ 2k+1, this is true for n = k+1
Hence, n2 < 2n for all n ≥5
Thus, since, 12=1<2=21,we have our conjecture is true.

17. Find the largest natural number m such that n3 - n is divisible by m for all n ∈ N .
Prove your assertion.
Answer :
 Suppose m divides n3 – n, ∀ n ∈ N
m | n3 – n m | n(n2 – 1)
m | n(n-1)(n+1), ∀ n ∈ N
since all n ∈ N , lets see what property does m have for n = 2
n = 2, m | n(n-1)(n+1) m | 2.3.1 =6
m|6
because m divide s 6, m must be less than or equal to 6
pssible choices for m are :
m = 1,2,3,6
m = 1 (satisfies)
 Note that n is either even or odd,
if n is even, the 2 divides n, so it also divides n(n+1)(n-1)
if n is odd, the n+1 is even, 2 divides n + 1 and consequently,
n(n+1)(n-1), therefore m = 2 also satisfies.
  look the possible cascs for n when dividing by 3
if n = 3k, for some k ∈ N , then 3 | n  3 | n(n+1)(n-1).
if n = 3k -1 for some k ∈ N , then n+1 = 3k  3 | n+13 | n(n+1)(n-1)
if n = 3k-2, for some k ∈ N , then n – 1 =3k-3=3(k-1) 3 | n-1 3 | n(n+1)(n-1)
therefore , m =3 , also satisfies,
we now have that:
2 | n(n+1)(n-1), ∀ n ∈ N
3 | n(n+1)(n-1), ∀ n ∈ N
 2.3 |n(n+1)( n−1), ∀ n ∈ N
 6 | n(n+1)(n-1) , ∀ n ∈ N
therefore m = 6 also satisfies, since m ≤ 6 , m=6 isthe largest possible mthat satisfies .

1 1 1
18. Prove that + +…+ > √n for all n ∈ N , n > 1
√1 √2 √n
Answer :
we will use induction on ‘n’.
1
 for n =1 , ≥√1
√1
 for n ≥ 2 ,
Assume the results for m ≤ n ,∧ prove it for m=n+1
for n+1 :
1 1 1 1
+ +…+ +
√1 √2 √ n √ n+1
by induction hypothesis,
1 1 1
+ +…+ ≥ √ n
√1 √2 √n
1 1 1 1 1 n+ 2 n+1
so, + +…+ + ≥ √ n+ = > =√ n+1
√1 √2 √ n √ n+1 √ n+1 √n+1 √ n+ 1
Proved.

19. Let S be a subset of N such that (a) 2k ∈ S for all k ∈N, and (b) if k ∈ S and k≥ 2,
then k - 1 ∈ S. Prove that S = N
Answer :
S⊆ N so it remains to show N ⊆ S
(a) Let n ∈ N , n≥ 2.
if n = 2k for some k ∈ N , then n∈ S by a).
if n ≠ 2k ,∀ k ∈ N , there exist k0 ∈ N such that n < 2k0.
define T= {m ∈ N : m < 2k0}
we’ll prove T ⊆ S by principle strong induction .
then,
m = 2k0-1 ∈ S (because of a) and b)
induction step :
Assume that {2k0-1, 2k0-2,…, 2k0-k1}⊆ S
then, 2k0-k1-1= (2k0-k1)-1 ∈ S by b).
therefore, T ⊆ S n ∈T ⊆ S N ⊆ S.s