SEQUENCE AND SERIES

WITH MATHEMATICAL INDUCTION

Math
in
Nature
 {1 , 3,5 , 7 . .
.

A :{ 3 , -5,9-1-7,33-1.3

93=219 =3 }
92=2192 ) ) -1
1-
Ag
-

.
,
.
,

=2Ca ) -1 ,
=
21921-1 94=219 ) -

1
= 9
-2137-1
-

Ay -17
-

=6 -1 95=214 ) -1 ,

Aa : -5
Ag=2Cay ) -1
 I

t .
-

+ :¥¥¥÷i :*

96
✗ or
% XXXVI
✗ 2×2×2 ✗2
Fibonacci

sequence

Leonardo of Pisa
Fibonacci= Son of Fibo

¥
31.5
> 1.6
] 1.6 .

> 1.6 . . .

to

÷:golden
3,5, 8 ,
13

:#I
Edouard Lucas

A-
i. : ☐

2 goat
la '

5
41,215 518113,21
,

13

21
 &
‘spurious correlation’
 %YneÑ
- .

+ 8 9
1 2 54 56th

C) 1)
E. =
( 1¥ )
"
-
()B
F-
Fiz =
233
 " "
Fai
( Itarsi ) ( Est )
-

Fs

1=21--10,946

Fibonacci series

¥2
F l
Sen 51=4
=
-

221-2

Fzy I
=

13,5
-

8 , 13 21
, ,

SFG Fata
series =
- l

Sfn =

Fn +2 t
-

I
=
Fg
-

51=4--1--4+2 -1
= 21-1

Sey Fg -1 =
=
20

=
8-1--7
Inductive =
specific to
general
art Gr
M.ME
→

M
 07%8%2
n
=
7

htl
⑧ Step 1 : show that n=1 is TRUE

step 2 : Assume that n

-
-
K is TRUE

induction hypotheses
step 3 Assume
: that n = Kt 1 is TRUE

Prove that induction hypotheses

step 4
:

step 1 : n =)
" "

I
11¥
=

1=4 TRUE

step 2 :
k(Y
11-21-3 t . . .tk =

3
step
:

(KH )
=(KHKKgt1tl)_
1+21-3 t . . .tk 1-

step 4 :
prove step
11-21-3 t k t (KH)
CKH¥Kt2)_
=
t . . .
 ( KH )
tf CKtDgkt2)_
I + =

* use step 2 to rewrite the left -

side

KCK.gl#tCKt1)- CKtl)gKt2)KCKtl) 2lkt1)- Ckt-Cgct-.2) (k1-

1) ( Kt 2)
2
I
lkt1)§K
Q . E. D
 Example 2

step 1 : show that n=1 is TRUE

n3=n4ny'
i.
=ñ:
1
112¥
=

1=4-4
1=01 TRUE

step 2 :
Assume that n=K is TRUE

131-231-37 KB
. . . 1- =

kYky
step 3 : Assume that nzkt ! is TRUE

131-23+33 t .
. .
tK3t ( Kt 1) 3--11<+112 ( Kt/ 1- 1) 2
4
step 4 : prove step 3
131-23+33 1- . . .
t it ( Kt 1Pa ( Kt 1) 41<1-272
* uset-epafrewritei.ve kit side
-
.
4
 -

k4E + (✗ +113 =

CKtnTykt
Ñ
"

kYKtÑt
Ck+ÑYgtzP_
41kt =

( 1<+1544-41 1<+11 )
4
=

(ktÑ(kt2P_
( KHIYKZT 9kt 4)

4
=

11<+114*+212
Fit 4kt 4 =
1kt 2) ( Kfz ) =
( Kt 2)
~

lkt"Tky' ✓=Ck+ñ P
Q E. D
.
 EXERCISES

Step 1 : show that n

-
-1 is True

( 2n -
1)
=
n2
2
24 ) -
I =
(1)
2-1 =
1

I ÉI TRUE

step 2 :
Assume that n=K is True

1+31-51-7 t . . . + (2k -
1) =
K2

is
step 3 :
Assume that n=Kt1 True

2
11-31-51-7 t 1- ( 2k 1) 1- ( 21kt 1) 1) ( Kt 1)
-

.
-
=
. .

step 4 prove
:
step 3

71-31-51-7 t . . .
1- ( 2k -
1) +1211<+17-11 =
( KH )
"

÷
* Use step 2 to rewrite the left side
-

2
K2 t (21121-1)-1 ) =
( Kt 1)
2
K2 + 21<1-2
-

I =
( KH )
Factored K
'
+2k 1- I =
( Ktm
form (K 1- 1) 2 = ( Kt 1)
2
Q .
E. D
 2a SUMMATIVE ASSESSMENT 1

1. Fibonacci
sequence
!g⑤④=Fzz+v
l
1=35 1=38 1=40 1=110
-

I , I

I
=Fzy
-

Recall that

(20 pts )
.

222:
( 10 pts .

ENCODE YOUR WORK USING OUR FORMAT PAPER.

USE PROPER EQUATION. SAVE WORK AS PDF WITH FILE NAME
LAST NAME_FIRST NAME_Section_SA1

¥÷÷i*
 Working Formula
17+2
n n 17+2

It 5 1- 5
It 5 1- 5

11-11-21-34 .it
. 2 2
2 2
1
5
5

Let ✗
=( 1T¥ ) & let
y=( 1¥ )
to write
your solutions easily