Digital download
I have achieved a first-class in Math by taking these notes. First-year uni math notes in SMA for those who struggle through the course or for uni applications interview.
Hope can help you pass the exam
Cheers
Suppose we want to
prove that same result is true for all +
integers ,
h .
If it can be shown that the
result holds for n=I and also that ,
for all N71 , if the result is true for n = N , then it must also
be true for n = Ntl , then follows that the result is true for all
positive n
Inland )
:=€=a for
'
Qin )
k equal Intl )
negative integer
=
Prove that pin ) is to :
any non n
Question
-
.
:
i. = stands for a
definition
0
' z
when n =
0 pie) = [ok = a = a
Q a) =
to 1410+1110-11 ) = 0 i. 1710 ) =
Q lol i . True for h= 0
i. Pll) = QU )
True for h =/
Assume it is true for n=N
i. PIN ) = QIN )
when n= Ntl when u = Ntl
PINHI = ET bi
① 1µg =
LNHI 121*1+11 IN -11+1 )
k= I
'
6
= FINI t Will =
to IN -11 ) 12N -13 ) IN -14
'
=
QINI + IN -111
2
=
IN IZNHIINH ) 1- IN -111 i. PINT ) = QI Ntl)
= '
Ntl ) ( IN lsNH ) + IN-111 ) since true for n=o ,
then it is t ru e for all IN
=
INH ) I NL2N-1II -161N -111 )
=
to INH ) I ZN2-1TN -16 )
= to IN -11112 # 3) IN -12 )
General template
:
all E IN
Claim f- In )= gin ) for n
proof : .
show f- lot =
gio )
-
show that for n
any
i
if f- In ) =
gun) ,
then final =
glntl )
1.3 Binomial theorem
Binaural coefficients :
i.
Definition Factorial function : n ! = 1×2×3 × . . . X In 2)
-
X In -
1) X h ,
h E IN
ht
0 ! =
I In -11 ! =
n i . It -11 ! = = I = 0 !
Factorial function is
only defined for -heintegemm
•
•
Factorial function is never zero
Binomial coefficient
2.
Definition :
For all h .
k E IN , h 7k ,
-
h
(1) with)
I
Ck
'
n choose k =
!
=
> .
Pascal 's triangle :
.to/--lnn/-- I
n!
proof :
(2) =
d. in -4 ! =
I
h !
(1) =
h ! In -
n ) !
=
I
i. 141=111
•
properties of Pascal 's
triangle
:
①
symmetry :
121=11 )
, h !
proof :
II ) =
k :( n -
KI !
(Ik )
n !
=
i. in -
ntkl !
=
4-kl ! k !
= II )
② I 1) = III ) + 1hL ) ,
For all in > k -
the number is the sum of two numbers above
k > o
In-1 ) ! In-11 !
Proof :
RHS =
µ -11 ! In -1 htt ) !
-
X k ! In -
I -
kl !
In -11 ! In -
1) !
As In k ) ! (n k-11 ! In k )
=
+
-
-
=
1k -11 ! 1h kl ! k ! In tkl !
-
- -
In -11 ! In -11 !
= +
1k -11 ! In -
tell ! Intel klk-11 ! In k -11 ! -
kin -11 ! + In-11 ! In k ) -
=
klk-11 ! In k -11 !
-
In - k)
= h In -11 !
talk-11 ! In -
k -
1) ! In k -
)
!
%)
n
=
In )
=
I box hand
k ! - k
II
-
The little on the
right
'
of proof
'
side means end
Binaural Theorem :
i. Binaural Theorem :
For any non -
negative integer IN
, nza
-1121
"
171 't -111)a" th
"
't
" " " ' "
(att ) =
a + a a + . . .
t . .
. + to
=
If (1) a
"-
kfk
-
Binaural coefficient
Question :
Express (text 't IHX 15 as a
polynomial in ×
'
HX15 5) 1+5×+10×2 -110×7+5×4 -1×5 )
'
4- X ) + I =
(I -5×+10×2 - lax -15×4 -
+ + I
= 21 It 10×2+5×4 )
induction
proof by
:
:
a.
• when n = 0
,
II. "kt_
'
4th ) =
I
,
IL) a 111111111=1
True for h = 0
Just to be sure
,
when u =/
(att )
'
= att ,
LEO 1k ) atktk =
4) a
'
b-
°
+ 11 )a°t
'
=
att
i. True for n= I
•
Assume it is true for h=n
¥
k
1k ) and
"
i. lattt =
.
b-
•
sub n = h t I
n
""
(att ) = late ) ( att )
=
4th ) ¥411)a"ktk expand the bracket
get
¥4111 ⇐ 111 antebkti
"'
th
"
-
+
+In-n+IfI
= a
k
an "tk
k
>
LEO (1) 12,1 "zk
"
-
-
=
+
a
-
shift the variables
the same
€ 1L) and € 11,1 and"zk+
"" " k htt
↳ > =
a + b- + b-
,
2 ,
"'
EI,[ (1) II ) )
""
*
= a
"'
+ + ,
an thet
property ②
111=1111 -11nF )
) and"zk
'
£2
htt
= and +
,
I + b-
II 1h11 anti kzk
-
=
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller BYRZ. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $8.30. You're not tied to anything after your purchase.
