A-level Pure Maths 1

Coming soon... 

We review the A-level pure maths as an introduction to university-level mathematics. We are NOT interested in the A-level exams. We are interested in refining our understanding of the maths!

  • Lecture 1: Algebra (Part 1)
    1. Background algebra
    2. Linear equations
    3. Changing the subject of a formula
    4. Quadratic equations
    5. Solving quadratic equations
  • Lecture 2: Algebra (Part 2)
    1. Equations that cannot be factorized
    2. The graphs of quadratic functions
    3. The quadratic formula
    4. Simultaneous equations
    5. Inequalities
  • Lecture 3: Coordinate geometry (Part 1)
    1. Coordinates
    2. Plotting, sketching and drawing
    3. The gradient of a line
    4. The distance between two points
    5. The mid-point of a line joining two points
  • Lecture 4: Coordinate geometry (Part 2)
    1. The equation of a straight line
    2. Finding the equation of a line
    3. The intersection of two lines
    4. Drawing curves
    5. The intersection of a line and a curve
  • Lecture 5: Sequences and series
    1. Definitions and notations
    2. Arithmetic progressions
    3. Geometric progressions
    4. Binomial expansions
  • Lecture 6: Functions
    1. The language of functions
    2. Composite functions
    3. Inverse functions
  • Lecture 7: Differentiation (Part 1)
    1. The gradient of a curve
    2. Finding the gradient of a curve
    3. Finding the gradient from first principles
    4. Differentiating by using standard results
    5. Using differentiation
    6. Tangents and normals
  • Lecture 8: Differentiation (Part 2)
    1. Maximum and minimum points
    2. Increasing and decreasing functions
    3. Points of inflection
    4. The second derivative
    5. Applications
    6. The chain rule
  • Lecture 9: Integration (Part 1)
    1. Reversing differentiation
    2. Finding the area under a curve
    3. Area as the limit of a sum
    4. Areas below the x-axis
    5. The area between two curves
  • Lecture 10: Integration (Part 2)
    1. The area between a curve and the y-axis
    2. The reverse chain rule
    3. Improper integrals
    4. Finding volumes by integration
  • Lecture 11: Trigonometry (Part 1)
    1. Trigonometry background
    2. Trigonometric functions
    3. Trigonometric functions for angles of any size
    4. The sine and cosine graphs
    5. The tangent graph
  • Lecture 12: Trigonometry (Part 2)
    1. Solving equations using graphs of trigonometric functions
    2. Circular measure
    3. The length of an arc of a circle
    4. The area of a sector of a circle
    5. Other trigonometric functions
  • Lecture 13: Vectors
    1. Vectors in two dimensions
    2. Vectors in three dimensions
    3. Vector calculations
    4. The angle between two vectors

Reference

  • Sophie Goldie (2012), Pure Mathematics 1, Hodder Education.
  • Jean Linsky, James Nicholson, Brian Western (2018), Complete Pure Mathematics 1, Oxford University Press.

Comments

Post a Comment

Popular posts from this blog

Open sets and closed sets in \(\mathbb{R}^n\)

Image
Open sets In \(\mathbb{R}\), we have the notion of an open interval such as \((a, b) = \{x \in \mathbb{R} | a < x < b\}\). We want to extend this idea to apply to \(\mathbb{R}^n\). We also introduce the notions of bounded sets and closed sets in \(\mathbb{R}^n\). Recall that the \(\varepsilon\)-neighbor of a point \(x\in\mathbb{R}^n\) is defined as \(N_{\varepsilon}(x) = \{y \in \mathbb{R}^n | d(x, y) < \varepsilon \}\) where \(d(x,y)\) is the distance between \(x\) and \(y\). Definition (Open set) A subset \(U\) of \(\mathbb{R}^n\) is said to be an  open set  if the following holds: \[\forall x \in U ~ \exists \delta > 0 ~ (N_{\delta}(x) \subset U).\tag{Eq:OpenSet}\] That is, for every point in an open set \(U\), we can always find an open ball centered at that point, that is included in \(U\). See the following figure. Perhaps, it is instructive to see what is  not  an open set. Negating (Eq:OpenSet), we have \[\exists x \in U ~ \forall \delta > 0 ~ (N_{\delta}(x) \not
Read more

Euclidean spaces

Image
We would like to study multivariate functions (i.e., functions of many variables), continuous multivariate functions in particular. To define continuity, we need a measure of "closeness" between points. One measure of closeness is the Euclidean distance. The set \(\mathbb{R}^n\) (with \(n \in \mathbb{N}\)) with the Euclidean distance function is called a Euclidean space. This is the space where our functions of interest live. The real line is a geometric representation of \(\mathbb{R}\), the set of all real numbers. That is, each \(a \in \mathbb{R}\) is represented as the point \(a\) on the real line. The coordinate plane , or the \(x\)-\(y\) plane , is a geometric representation of \(\mathbb{R}^2\), the set of all pairs of real numbers. Each pair of real numbers \((a, b)\) is visualized as the point \((a, b)\) in the plane. Remark . Recall that \(\mathbb{R}^2 = \mathbb{R}\times\mathbb{R} = \{(x, y) | x, y \in \mathbb{R}\}\) is the Cartesian product of \(\mathbb{R}\) with i
Read more

Newton's method

Image
Newton's method (the Newton-Raphson method) is a very powerful numerical method for solving nonlinear equations.  Suppose we'd like to solve a non-linear equation \(f(x) = 0\), where \(f(x)\) is a (twice) differentiable non-linear function. Newton's method generates a sequence of numbers \(c_1, c_2, c_3, \cdots\) that converges to a solution of the equation. That is, if \(\alpha\) is a solution (i.e., \(f(\alpha) = 0\)) then,  \[\lim_{n\to\infty}c_n = \alpha,\] and this sequence \(\{c_n\}\) is generated by a series of linear approximations of the function \(f(x)\). Theorem (Newton's method) Let \(f(x)\) be a function that is twice differentiable on an open interval \(I\) that contains the closed interval \([a, b]\) (i.e., \([a,b]\subset I\)) and satisfy the following conditions: \(f(a) < 0\) and \(f(b) > 0\); For all \(x\in [a, b]\), \(f'(x) > 0\) and \(f''(x) > 0\). Let us define the sequence \(\{c_n\}\) by \[ \begin{eqnarray} c_1 &
Read more