Furt he r P ur e 1 Chapt er 8: P roof
In A-Level M at h ematics, t h e con cep t of a series p lays a c ru c ial role. A series is essent ially t he su m of a sequ enc e of numb ers. When we t alk ab out
summin g a seq uenc e, we oft en u se a con cise mat h emat ic al n ot at ion in t rodu c ed b y t he S wiss math ematician Leon hard Eu ler, kn own as sigma
not at ion .
When constructing buildings
Video Support or bridges, engineers often UAE link
https://www.examsolutions.net/ need to calculate loads and Dubai is renowned for
international-exams/edexcel/fp1- hosting large-scale
tutorials/#google_vignette stresses. For instance, if a events and festivals,
bridge is designed to hold a such as the Dubai
Shopping Festival and
series of evenly distributed
the Dubai World Cup.
https:// loads (like vehicles crossing Event planners often
www.examsolutions.n the bridge), engineers use use summation to
et/international- series to determine the total
estimate the total costs
involved. If they need to
exams/edexcel/fp1- load the bridge can handle. In computer science, budget for various
tutorials/ This involves summing up the algorithms often involve aspects like catering,
#google_vignette operations that repeat a security, and
effects of all individual loads entertainment, they
to ensure safety and structural certain number of times, sum the individual costs
integrity. such as loops in to get the total
programming. expenditure. Sigma
notation helps in
organizing and
simplifying these
budget calculations.
Big Question
How does using sigma notation simplify the
process of evaluating complex series by
systematically representing the sum of terms
in a compact form?
Chapter 8.3 Proof by Mathematical Induction
Chapter 8.3 Proof by Mathematical Induction
Given that un+1 = 3un + 4, u1 = 1,
prove by induction that un = 3n – 2. BASIS
Show that the statement is true for n = 1 and n
=2
𝑢𝑛+1=3 𝑢𝑛 + 4 𝑢1= 1 𝑛
𝑢𝑛 =3 − 2
So we are being asked to show
There is a slight difference here. As we are given u1
that, for the sequence with this already (n = 1), we need to also check the statement is
recurrence relation, that the nth true for n = 2…
𝑢𝑛+1=3 𝑢𝑛 + 4 𝑛
𝑢𝑛 =3 − 2
term formula is 3n – 2… We already
know u1 Sub in n =
1
𝑢1= 1 Now use the 1
𝑢1= 3 − 2
recurrence Calculate
relation to 𝑢1= 1
BASIS 𝑢2 =3 𝑢1 + 4 find u2 Now sub in
n=2
Calculat 2
ASSUMPTION 𝑢2 =7 e 𝑢2 =3 −2
Calculat
𝑢2 =7 e
INDUCTIVE
The first 2 terms are both 1 and 7, so the statement is
CONCLUSION true for n = 1 and 2
Chapter 8.3 Proof by Mathematical Induction
Given that un+1 = 3un + 4, u1 = 1,
prove by induction that un = 3n – ASSUMPTION 𝑢𝑛+1=3 𝑢𝑛 + 4
2. Assume that the statement is true for n = k
+¿¿
𝐹𝑜𝑟 𝑛=𝑘, 𝑢𝑘=3 −2𝑓𝑜𝑟 𝑘 ∈ ℤ
𝑘
So we are being asked to show INDUCTIVE
that, for the sequence with this Use the recurrence relation to create an expression for
recurrence relation, that the nth uk+1
𝑢𝑘 +1=3 𝑢 𝑘+ 4
term formula is 3n – 2… Replace uk with the
assumed expression
𝑘
𝑢𝑘 +1=3 (3 −2)+ 4 above
Multiply out the brackets
BASIS 𝑢𝑘 +1=3
𝑘+1
−6+ 4
Simplify
ASSUMPTION 𝑘+1
𝑢𝑘 +1=3 −2
INDUCTIVE
CONCLUSION
Chapter 8.3 Proof by Mathematical Induction
Given that un+1 = 3un + 4, u1 = 1,
prove by induction that un = 3n – 2. INDUCTIVE
Use the recurrence relation to create an expression for
uk+1
So we are being asked to show 𝑢𝑘 =3 −2
𝑘
The ‘k’ terms have
that, for the sequence with this 𝑘+1 all become ‘k + 1’
recurrence relation, that the nth 𝑢𝑘 +1=3 −2 terms
term formula is 3n – 2…
CONCLUSION
If the statement is true for ‘k’, it is also true for ‘k + 1’
BASIS
We showed in the basis that it is true for n = 1 and n =
ASSUMPTION 2
INDUCTIVE Therefore the statement is true for all
CONCLUSION
Chapter 8.3 Proof by Mathematical Induction
Given that un+2 = 5un+1 – 6un, and
u1 = 13 and u2 = 35: 𝑢𝑛+2=5 𝑢𝑛+1 − 6 𝑢𝑛 𝑢1= 13 𝑢2 =35
The next The The The first The
term in the current previous term second
Prove by induction that un = 2n+1 sequence term term term
+ 3n+1
So for this sequence, the next term is based on the
current term AND the term before that!
This is why you have been given the first 2 terms…
This sequence is slightly
different to what you have seen!
BASIS
ASSUMPTION
INDUCTIVE
CONCLUSION
Chapter 8.3 Proof by Mathematical Induction
BASIS
Show that the statement is true for n = 1, n = 2 and n =
Given that un+2 = 5un+1 – 6un, and 3
u1 = 13 and u2 = 35: 𝑢𝑛+2=5 𝑢𝑛+1 − 6 𝑢𝑛 𝑢𝑛 =2
𝑛 +1
+3
𝑛+1
We already
know u1 2 2
𝑢1=13𝑢2 =35 and u2 𝑢1= 2 +3
Calculate
Prove by induction that un = 2 n+1
+ 𝑢1=13
3n+1 𝑢3 =5 𝑢2 −6 𝑢1 Sub in u2
and u1 to 3 3
𝑢2 =2 +3
𝑢3 =5(35)− 6(13) find u3
Calculate
Calculate 𝑢2 =35
𝑢3 =97
This sequence is slightly different 4 4
𝑢3 =2 +3
to what you have seen! Calculate
𝑢3 =97
BASIS
The first 3 terms are 13, 35 and 97 for both sequences,
ASSUMPTION so the statement has been shown to be true up to n = 3
INDUCTIVE
CONCLUSION
Chapter 8.3 Proof by Mathematical Induction
Given that un+2 = 5un+1 – 6un, and ASSUMPTION 𝑢𝑛+2=5 𝑢𝑛+1 − 6 𝑢𝑛
u1 = 13 and u2 = 35: Assume that the statement is true for n = k AND n = k
+1 +¿¿
𝐹𝑜𝑟 𝑛=𝑘, 𝑢𝑘=2 +3 𝑓𝑜𝑟 𝑘 ∈ ℤ
𝑘+1 𝑘+1
+¿¿
𝐹𝑜𝑟 𝑛=𝑘+1 , 𝑢𝑘 +1=2 +3 𝑓𝑜𝑟 𝑘 ∈ ℤ
𝑘 +2 𝑘+2
Prove by induction that un = 2n+1 + INDUCTIVE
3n+1
Use the recurrence relation to create an expression for
uk+2
𝑢𝑘 +2=5 𝑢 𝑘+1 − 6 𝑢𝑘 Sub in the assumed
expressions for uk+1 and uk
𝑘 +2 𝑘 +2
This sequence is slightly different 𝑢𝑘 +2=5 (2 ) ¿ ¿𝑘+1+3𝑘+1)¿
+ 3 −6(2 from before
Split the bracketed
to what you have seen! parts up
) ( 2𝑘 +1 ) − 6 ( 3 )
𝑘 +2 𝑘+2 𝑘+1
𝑢𝑘 +2=5 (2 )+5 (3 −6
Rewrite all as
powers of ‘k + 2’
) ( 2𝑘+−2) ( 3𝑘+ 2 )
𝑘 +2 𝑘+2 2
𝑢𝑘 +2=5 (2 )+5 (3 −3 (see below)
BASIS
ASSUMPTION
6 ( 2𝑘+1 ) 6 ( 3𝑘 +1 )
INDUCTIVE 6=3x 6=2x
¿ 3 × 2 ( 2𝑘+1 ) 2
The 2 ¿ 2 ×3 ( 3𝑘 +1 ) 3
The 3
CONCLUSION adds 1 to adds 1 to
¿ 3 ( 2𝑘+2 ) the power ¿ 2 ( 3 𝑘+2 ) the power
Chapter 8.3 Proof by Mathematical Induction
Given that un+2 = 5un+1 – 6un, and ASSUMPTION 𝑢𝑛+2=5 𝑢𝑛+1 − 6 𝑢𝑛
u1 = 13 and u2 = 35: Assume that the statement is true for n = k AND n = k
+1 +¿¿
𝐹𝑜𝑟 𝑛=𝑘, 𝑢𝑘=2 +3 𝑓𝑜𝑟 𝑘 ∈ ℤ
𝑘+1 𝑘+1
+¿¿
𝐹𝑜𝑟 𝑛=𝑘+1 , 𝑢𝑘 +1=2 +3 𝑓𝑜𝑟 𝑘 ∈ ℤ
𝑘 +2 𝑘+2
Prove by induction that un = 2n+1 +
INDUCTIVE
3n+1
Use the recurrence relation to create an expression for
uk+2
𝑢𝑘 +2=5 𝑢 𝑘+1 − 6 𝑢𝑘 Sub in the assumed
expressions for uk+1 and uk
𝑘 +2 𝑘 +2
This sequence is slightly different 𝑢𝑘 +2=5 (2 ) ¿ ¿𝑘+1+3𝑘+1)¿
+ 3 −6(2 from before
Split the bracketed
to what you have seen! parts up
) ( 2𝑘 +1 ) − 6 ( 3 )
𝑘 +2 𝑘+2 𝑘+1
𝑢𝑘 +2=5 (2 )+5 (3 −6
Rewrite all as
powers of ‘k + 2’
) ( 2𝑘+−2) ( 3𝑘+ 2 )
𝑘 +2 𝑘+2 2
𝑢𝑘 +2=5 (2 )+5 (3 −3
BASIS Group the ‘like’
terms
𝑘+ 2 𝑘+2
ASSUMPTION 𝑢𝑘 +2=2 (2 )+3 (3 )
The 2 and 3 add 1 to the powers
𝑘+3 𝑘+ 3 of 2 and 3 respectively
INDUCTIVE 𝑢𝑘 +2=2 +3
CONCLUSION
Chapter 8.3 Proof by Mathematical Induction
Given that un+2 = 5un+1 – 6un, and CONCLUSION
u1 = 13 and u2 = 35:
𝑘+1 𝑘+1
𝑢𝑘 =2 +3
𝑘+2 𝑘+2 ( 𝑘+1 ) +1 ( 𝑘 +1) +1
Prove by induction that un = 2n+1 + 3n+1 𝑢𝑘 +1=2 +3 𝑢𝑘 +1=2 +3
( 𝑘+ 2) +1 ( 𝑘+2 ) +1
𝑢𝑘 +2=2
𝑘+3
+3
𝑘+ 3 𝑢𝑘 +2=2 +3
This sequence is slightly different to These can both
be written
what you have seen! differently
As you can see, k is replaced with (k + 1), and then with (k + 2)
BASIS
So we have shown that IF the statement is true for n = k and n
ASSUMPTION = k + 1, then it must also be true for n = k + 2
INDUCTIVE
As we showed in the basis that the statement is true for n = 1
CONCLUSION and n = 2, then it must therefore be true for n = 3
And consequently it is then true for all values of n!
Chapter 8.3 Proof by Mathematical Induction
Chapter 8.3 Proof by Mathematical Induction
