Download as pdf or txt
Download as pdf or txt
You are on page 1of 12

& WHAT EVEN IS A TAR HEEL

2)2 ↳0194214138180 19017 74911

-
↑(c + z) = 2) + 7) mod25
4 1471 1121120 150 =11724 14111118

=OuB
LDLUABRY OLLS
2)
-DRIEEBESI1 & &MXXXX

D
-
& 82BEE@RIPSX ** XM
- -

A ROOW BEFFU ORTDS XXXXM

Da) nesas
p=5 g =79 e=4)

25 <395 N = 1 & (n) = 312


25254395

#(c) (S 1)(79 1)
=
- - =
312
9) Inductive Step Continued
Statement

I
Reason

⑤ (n-2) (n 1) (3n u)
= + +
Fador RMS (n)
*

⑥ (n -2) (n+1) (3(n 1) +1)


= + Factor .
RMS (u)

Thus , we have
proven
that P(n+1) :
(on -2) = (n + 1) (3(n 1) + 1)
+

is true when Pla) is true


. This
completes be inductor .
step
Conclusion
-

Wa have proven the base case P(1).


the inelution
We have preven step
We have the desired claim by math induction .
promen
10) We will
prove
that (1th)"21thn for all

proced
+
nt & ·
Note that n20 .
We will by proof by
mathematical induction
.

Our base case is P(1) .

Bay Case :

Reason

I
statement
& (Hn)" = 1+hn ,
n= / sinen

& (1+h)' 2 Ith(l) Substitution

③ IthIth Simplification (2)


*
Thus have the base case P(1) (1th)
:
= 1+h (1).
, we
power
This completes the basis
step
-
Inductive
- Hypothesis
integer
Assume P(n) is true
for some arbitrary fixedt 21.
net
(Ith"
Aka , acsume = Itha
for some
crbitury fixed int

Inductive Step
-are will
prove**
that if P(r) ,
P(n+1) is true
.

Note that P(mel) (1+h) - Ith(n-1). :

You might also like