IB DP Maths: AA HL复习笔记1.5.1 Proof by Induction
What is proof by induction?
- Proof by induction is a way of proving a result is true for a set of integers by showing that if it is true for one integer then it is true for the next integer
- It can be thought of as dominoes:
- All dominoes will fall down if:
- The first domino falls down
- Each domino falling down causes the next domino to fall down
- All dominoes will fall down if:
What are the steps for proof by induction?
- STEP 4: The conclusion step
- State the result is true
- Explain in words why the result is true
- It must include:
- If true for n = k then it is true for n = k + 1
- Since true for n = 1 the statement is true for all n ∈ ℤ, n ≥ 1 by mathematical induction
- The sentence will be the same for each proof just change the base case from n = 1 if necessary
What type of statements might I be asked to prove by induction?
Exam Tip
- Learn the steps for proof by induction and make sure you can use the method for a number of different types of questions before going into the exam
- The trick to answering these questions well is practicing the pattern of using each step regularly
Worked Example
转载自savemyexams
以上就是关于【IB DP Maths: AA HL复习笔记1.5.1 Proof by Induction】的解答，如需了解学校/赛事/课程动态，可至翰林教育官网获取更多信息。
往期文章阅读推荐：
IBO官宣2027年课改：数学、语言、艺术全调整，你的学习计划要更新了！
深耕九载！30+国际竞赛/课程讲义，硕博100%团队操刀，助力爬藤冲G5！
翰林AMC8视频课重磅上线！
国际竞赛真题资源免费领取
