H2 Further Mathematics 9649 Pure Math Notes

H2 Further Mathematics 9649 Pure Mathematics Zhuo Zhuzhen Hwa Chong Institution

Preface One of my most vivid memory from JC is how I was con- templating my life decisions after finding out that my friend who dropped FM for computing was getting easy As while I was stuck with my Ds no matter how hard I tried. Indeed, I don’t think many can deny the fact that FM is a difficult subject, and I would argue its one of the most difficult A level subject there is. Perhaps you are feeling the same struggle - and maybe even a bit of helplessness - as I once did. Pure mathematics can feel really demoralising at times, es- pecially given how creative examiners can be. However, just remember that the very fact that you are reading this means that you have the ability to do well in this subject (since you passed the selection test). The power of spamming papers and questions should not be understated - remember to never give up no matter how difficult it seems. I created this set of notes as a convenient reference for myself for everything that I needed to know about FM and as a tool for memorising the dozens of formulas. Now that it has served its purpose, I hope it will be as useful to you in achieving your desired goals, just as I was able to achieve mine. All the best for all your future exams! I

Acknowledgements This entire set of notes is an adapted and summarised ver- sion of the Further Mathematics notes created by HCI Math Department. Most figures are taken directly from the source. Special thanks must also be given to my FM teachers, Mr Ng Say Tiong and Miss Ho Jia Yuan, for working so hard and being so selfless. II

Table of Contents 1 Recurrence Relations and Mathematical Induction 1 1.1 Convergence of Infinite Sequence . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Proving . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.3 Solutions to RR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.3.1 First Order . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.3.2 Second Order . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.4 Mathematical Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2 Numerical Methods 3 2.1 Determining the Existence of Roots . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.1.1 Graphical Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.1.2 Analytical Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Approximate Roots . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2.1 Linear Interpolation Method . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2.2 Fixed Point Iteration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2.3 Newton-Raphson Method . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Approximate Definite Integrals . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.3.1 Trapezium Rul