• Congratulations to the Class of 2024 on your results!
    Let us know how you went here
    Got a question about your uni preferences? Ask us here

mathematical induction for ext 1 and ext 2 (1 Viewer)

dan964

what
Joined
Jun 3, 2014
Messages
3,479
Location
South of here
Gender
Male
HSC
2014
Uni Grad
2019
An essential skill. A shame none in 2014 hsc.

Methodology:
- Prove it is true for the FIRST CASE (which may not be n=1). If the FIRST CASE is trivial (example: 1+1 =2), then prove also for the
SECOND CASE.
- Assume the formula is true for n=k. Make your assumption then by letting n=k in the formula.
- Then for the next term usually n=k+1. You will need to 'rig' it to put your assumption back in, and prove it is of the same form as n=k.

Tips and Tricks:
- Don't do what some people do which is "Assume n=k". You are not proving that n=k. You are proving the formula is true.
- With inequalities, it is sometimes easier to see when rearranging your assumption by subtracting terms from both sides.
- Sometimes k>M, a certain value. If that is the case, it may come in handy.
- If the question involves a variable 'x' or a polynomial, then write A(x) or something not M.

Worked Examples. These are from my Year 11 book, as induction was the first topic we did in Year 11.
- Feel free to attempt them without looking at my proof.

For extension 2 students, if you are looking for more stuff; I would recommend proving something like Demoivre's Theorem.
The old 3U Fitzpatrick has some really good Mathematical Induction questions.
(The thing with Fitzpatrick is he puts all his hard questions at around Q2 sometimes)

View attachment 31612
 

braintic

Well-Known Member
Joined
Jan 20, 2011
Messages
2,137
Gender
Undisclosed
HSC
N/A
Ext 2 students should also be familiar with strong induction.
 

braintic

Well-Known Member
Joined
Jan 20, 2011
Messages
2,137
Gender
Undisclosed
HSC
N/A
"strong induction", what's that lol
Assume true for n=1,2,3,...k
Prove true for n=k+1

A weakened form of strong induction is required for proving general term results for Fibonacci-like series.
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top