* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Further Pure 1
Survey
Document related concepts
Georg Cantor's first set theory article wikipedia , lookup
Vincent's theorem wikipedia , lookup
Large numbers wikipedia , lookup
Mathematical proof wikipedia , lookup
List of important publications in mathematics wikipedia , lookup
Factorization wikipedia , lookup
Bra–ket notation wikipedia , lookup
Proofs of Fermat's little theorem wikipedia , lookup
Elementary mathematics wikipedia , lookup
System of polynomial equations wikipedia , lookup
History of algebra wikipedia , lookup
Transcript
SPECIFICATION CONTENTS FOR FP1 (NEW) TERM AUTUMN CONTENT Series Complex Numbers SPRING Numerical Solutions Coordinate Systems (Conic Sections) SUMMER Matrix Algebra Proof Revision Papers You will be tested on the content covered each half term and be awarded an internal grade to assess progress. Click here for a FP1 Mindmap Notes:- Page 1 SCHEME OF WORK FOR AS - FURTHER MATHS MODULE FP1 Text : - Heinemann ‘FP1 for Edexcel’ (OLD FP1) ISBN-10: 0435511092 ISBN-13: 978 0435511098 There are also linked Exercised from PURE MATHEMATICS 4 Syllabus 1992-04 Authors G Mannall and M Kenwood CHAPT. TOPIC Ch. 2 P. 11-19 (OLD FP1) 1. Series TIME OBJECTIVES (wks) (FP1 Specification) 2 Summation of simple finite series. Standard results may be quoted from the Formula Book. Method of Differences is not required Ch. 3 P. 21-48 (OLD FP1) 2. Complex Numbers SPECIFICATION NOTES METHODOLOGY Review C1/C2 use of the Σ symbol for A.P & G.P. Show that Σr is really an A.P n n n 2 2 r, r (r + 2) with a=1, d=1. r , Run through C1 proof to r=1 r=1 r=1 illustrate the formula in the book. Proof by induction is not Review Partial Fractions (C4) to break down complicated ‘r’ required yet fractions to be summed. (See topic 6.Proof) OTHER RESOURCES Candidates should be able to sum series such as Summing Series PowerPoint N.B. Σ 1 (from 1 to n) = n ASSESSMENT (Old FP1) Ex 2A pg 15 (Using Identities and Numerical Substitution) Ex 2B pg 18 Using Standard Results for n r =1 n n r , r r =1 2 , r3 r =1 3 Definition of complex numbers in the form a + ib and r cos + i r sin . The meaning of conjugate, modulus, argument, real part, imaginary part and equality of complex numbers should be known. z1 z 2 = z1 z 2 Page 2 Begin by looking at a previously ‘unsolvable’ Quadratic, i.e. b2 – 4ac < 0. Sketch the graph and show Complex that it does not cross the x- Numbers axis (no real roots). The Basics Put across the idea that we need an imaginary axis to cross for some sort of root to exist. (Old FP1) Ex 3A pg 26 (Manipulating Complex Numbers and Solving “Complex” Quadratics) Ch. 3 P. 21-48 (OLD FP1) 2. Complex Numbers (cont.) Sum, product and quotient of complex numbers. Geometrical representation of complex numbers in the Argand diagram. Complex solutions of Geometrical quadratic equations representation of sums, with real coefficients. products and quotients of complex numbers. Link with vectors Conjugate complex covered in C4. roots of polynomial equations with real Knowledge that if z1 is a coefficients. root of f(z) = 0 then z1* is also a root. Define i as √(-1). Hence i2 =1. Link Argand Diagrams with i, j vectors (C4/M1) and Modulus/Arg with Magnitude and Direction. Use difference of two squares and Surds (Rationalisation) to illustrate the method of manipulation of Complex Conjugates. Complex Numbers Loci examples using Argand diagrams (Old FP1) Ex 3B pg 34 (Argand Diagrams) Ex 3C pg 41 (Modulus – Argument) Ex 3D pg 46 (Harder Equations and Conjugate Roots) (See ‘Complex Numbers’ section of the Open University Maths DVD.) Link with Polar Coordinates (FP2) Ch. 4 P. 51-65 (OLD FP1) 3. Numerical Solutions of Equations 1-2 Equations of the form f(x) = 0 solved numerically by:(i) interval bisection, Begins with a review of Iterations from C3. This chapter is about functions which will not (ii) linear interpolation iterate. (iii) Newton-Raphson process. Therefore we need other methods to find the roots. Page 3 Show that the roots are where the graph crosses the x-axis. Interval Bisection Use Omnigraph to zoom in to Interval the solutions as the interval Bisection and bisects. Construct tangents using Omnigraph to illustrate how Newton-Raphson works Linear Interpolation NewtonRaphson (Old FP1) Ex 4A pg 61 (Mixed Exercise with all 3 methods) CHAPT. TOPIC TIME (wks) 4. Coordinate 2-3 Systems (Conic Sections) OBJECTIVES (FP1 Specification) Cartesian equations for the Parabola and Rectangular Hyperbola. Idea of parametric equation for parabola and rectangular hyperbola. The focus-directrix property of the parabola. SPECIFICATION NOTES The idea of (at2, 2at) as a general point on the parabola is all that is required. Concept of focus and directrix and parabola as locus of points equidistant from focus and directrix. Differentiation of 1 1 c2 . x Parametric differentiation See FP3 for the Ellipse. is not required. 5. Matrix Algebra OTHER RESOURCE Revise Parametric Equations from C4. Some notes and Candidates should be diagrams familiar with the equations: about Conic 2 2 y = 4ax or x = at , y = 2at Sections. (Parabola) and y = 2a 2 x 2 , y = Tangents and normals to these curves. METHODOLOGY xy c 2 or x ct , y c . t (Hyperbola) Use Omnigraph and Geometers Sketchpad to illustrate Focus-Directrix properties. Sketchpad illustration of the Parabola 2-3 Stress the importance of thinking in terms of Rows and Columns. Addition and subtraction of matrices. Define Singular and nonsingular matrices. Use of the relation Multiplication of a matrix by a scalar. Products of matrices. Evaluation of 2 × 2 determinants. Use the Row x Column Rule Show the Identity (2 x 2) for Multiplication matrix. (Hence RC – Roman Catholic!) Identification and use of the matrix representation of the following single and (AB)–1 = B–1A–1. combined transformations. Inverse of 2 × 2 matrices. Page 4 Matrix Addition & Multiplication ASSESSMENT 5. Matrix Algebra (Cont.) 2 6. Proof (By Induction) Linear transformations Applications of matrices to of column vectors in geometrical two dimensions and transformations. their matrix representation. Proof by the Method of Induction. (Four types of examples) n r 1 n(n 1)(n 2) 3 * Matrix Products e.g. show 2 1 1 3n n 9 4 3n 1 9n n . Summary of different 2 x 2 Transformation Matrices To include induction proofs Show that all the situations basically follow the same for procedure. * Divisibility e.g. show 32 n 11 is * Summation of series divisible by 4. e.g. Show * Finding general terms n in a sequence r 3 14 n 2 (n 1) 2 or e.g. if un1 3un 4 r 1 r (r 1) a) Reflection in coordinate axes and lines y = +x, b) Rotation of multiples of 45 about (0, 0). c) Enlargement about centre (0, 0), with scale factor, (k ≠ 0), where k ℝ. 1) Assume the statement to prove IS true for n = k (where k is a positive integer) 2) Write an expression for the next term i.e. n = k + 1 (by writing the kth term and adding the next term) Mathematical Induction Notes & Examples with u1 1 , prove that 3) Manipulate this expression and Mathematical simplify it to look like the original Induction un 3n 2 . expression with a (k+1) replacing PowerPoint all the k’s. Revise the following Chapters:Series & Matrices (FP1), and Iterations (C3) Page 5 4) This has proved that the situation works for k, k+1 etc. 5) Therefore it can be induced that it would work for k+1 & k+2 in a similar way. Hence it works for all positive integers k. Formulae given in the Formula Booklet Page 6