Paper 1: Final Exam Predictions

Whiteboard Review & Verification Checklist
Non-Calculator Focus
1

Function (Comprehensive)

πŸ“˜ Asymptote Classification β€” Rational Functions $f(x) = \frac{P(x)}{Q(x)}$

Let $\deg P = m$, $\deg Q = n$:

  • $m < n$: HA at $y = 0$ (horizontal asymptote at $y = 0$).
  • $m = n$: HA at $y = \frac{\text{leading coefficient of }P}{\text{leading coefficient of }Q}$.
  • $m = n + 1$: No HA. SA at $y = (\text{quotient from division})$ β€” a linear oblique asymptote.
  • $m > n + 1$: No HA, no SA. End behavior follows a higher-degree polynomial (curve asymptote).
  • VA: Occurs at real roots of $Q(x) = 0$ that are not cancelled by $P(x) = 0$.
⚠️ Special Function Asymptotes (Paper 1 Traps):
  • Exponential $y = e^x$: HA at $y = 0$ (as $x \to -\infty$). No VA.
  • Exponential $y = e^{-x}$: HA at $y = 0$ (as $x \to +\infty$). No VA.
  • Logarithm $y = \ln x$: VA at $x = 0$. No HA ($\ln x \to \infty$ as $x \to \infty$).
  • Inverse $y = \frac{1}{x}$: VA at $x = 0$, HA at $y = 0$ (both directions).
  • Arctan $y = \arctan x$: HA at $y = \frac{\pi}{2}$ and $y = -\frac{\pi}{2}$. No VA.
πŸ”— Cross-Topic (Sequences): Function outputs can form an arithmetic or geometric progression.
  • AP: $u_n = u_1 + (n-1)d$,   $S_n = \frac{n}{2}\big(2u_1 + (n-1)d\big) = \frac{n}{2}(u_1 + u_n)$
  • GP: $u_n = u_1 \cdot r^{\,n-1}$,   $S_n = \frac{u_1(r^n - 1)}{r - 1} = \frac{u_1(1 - r^n)}{1 - r}$,   $S_\infty = \frac{u_1}{1 - r}$ for $\vert r \vert < 1$
⚠️ Critical Checks:
  • Inverse Functions: Ensure domain is strictly one-to-one (pass Horizontal Line Test). Domain $\leftrightarrow$ Range swaps for $f^{-1}(x)$.
  • Composite Functions: Check that Range of inner $g(x)$ fits entirely inside Domain of outer $f(x)$. Practice $f(g(x))$ vs $g(f(x))$.
2

Logarithmic & Exponential

⚠️ Change-of-Base Rule (IB Booklet Notation): $$ \log_a b = \frac{\log_c b}{\log_c a} $$

In practice: $\log_a b = \frac{\ln b}{\ln a}$. Base stays on the bottom!

3,6

Polynomial / Binomial Theorem / Counting

πŸ“˜ Binomial Theorem (IB Formula Booklet)

For $n \in \mathbb{N}$:

$$(a + b)^n = a^n + \binom{n}{1}a^{n-1}b + \binom{n}{2}a^{n-2}b^2 + \dots + \binom{n}{r}a^{n-r}b^r + \dots + b^n$$

Or equivalently in summation form:

$$(a + b)^n = \sum_{r=0}^{n} \binom{n}{r} a^{\,n-r} b^{\,r}.$$

General term (used to find a specific term):

$$T_{r+1} = \binom{n}{r} a^{\,n-r} b^{\,r}, \quad r = 0, 1, 2, \dots, n.$$

Binomial coefficient (combinations):

$$\binom{n}{r} = {}^nC_r = \frac{n!}{r!\,(n-r)!}.$$
  • Key properties: $\binom{n}{0} = \binom{n}{n} = 1$, $\binom{n}{1} = \binom{n}{n-1} = n$, $\binom{n}{r} = \binom{n}{n-r}$ (symmetry).
  • Pascal's triangle: Each entry is the sum of the two above: $\binom{n}{r} + \binom{n}{r+1} = \binom{n+1}{r+1}$.
  • Common Paper 1 trick: Find the coefficient of $x^k$ in expansions like $(2x - 3)^5$ or $(1 + 2x)^n(1 - x)^m$. Identify which $r$ gives the desired power.
πŸ“˜ Permutations & Combinations (Counting)
  • Permutation (order matters): ${}^nP_r = \frac{n!}{(n-r)!}$.
  • Combination (order does not matter): ${}^nC_r = \binom{n}{r} = \frac{n!}{r!(n-r)!}$.
  • Tie-Together Method: Treat locked items as one block, then multiply by internal permutations.
  • Slotting / Gap Method: Arrange unrestricted items first, then place restricted items into the gaps.
  • Case-by-case: When direct counting is complex, break into mutually exclusive cases and sum.
5

Vector (Matrix Equations)

⚠️ Solution Classification (parametric constants like $k$):
  • Unique Solution: REF gives three pivot rows & no contradictions. Solve directly.
  • No Solution: A contradictory row appears: $[0 \; 0 \; 0 \; \vert \; k]$ where $k \neq 0$.
  • Infinite Solutions: A zero row appears: $[0 \; 0 \; 0 \; \vert \; 0]$. Assign a parameter (e.g., $z = t$) and express $x, y$ in terms of $t$.
7

Mathematical Induction

⚠️ Common Paper 1 Induction Types:
  • Summation formulas: Prove $\sum_{r=1}^n f(r) = g(n)$.
  • Divisibility: Prove $4^n - 1$ is divisible by 3 for all $n \in \mathbb{Z}^+$.
  • Inequalities: Prove $2^n > n^2$ for $n \ge 5$.
  • Recurrence relations: Given $u_{n+1} = f(u_n)$, prove closed form $u_n = g(n)$.
8,9

Limit & Implicit Differentiation

⚠️ Board Notation Warning: The board sometimes maps $\frac{dx}{dy}$. Verify carefully whether the problem asks for $\frac{dy}{dx}$ or $\frac{dx}{dy}$.

Standard derivatives to recall (IB Booklet):
$(\sin x)' = \cos x$,   $(\cos x)' = -\sin x$,   $(\tan x)' = \sec^2 x$,
$(e^x)' = e^x$,   $(\ln x)' = \frac{1}{x}$,   $(x^n)' = nx^{n-1}$.
10

Vector (3D Geometry)

πŸ“˜ Key Formulas (IB Booklet):
  • Distance from point $A$ to plane $\Pi$: $\frac{\vert \overrightarrow{AB} \cdot \hat{n} \vert}{\vert \hat{n} \vert}$, where $B$ is a point on the plane.
  • Angle between two lines: $\cos\theta = \frac{\vec{b}_1 \cdot \vec{b}_2}{\vert\vec{b}_1\vert\vert\vec{b}_2\vert}$.
  • Angle between line and plane: $\sin\theta = \frac{\vec{b} \cdot \hat{n}}{\vert\vec{b}\vert\vert\hat{n}\vert}$.
11

Complex Number

πŸ“˜ n-th Roots of Unity β€” Solving $z^n = 1$:
  • Roots: $z_k = e^{i\frac{2\pi k}{n}}$ for $k = 0, 1, 2, \dots, n-1$.
  • Positioned as vertices of a regular $n$-gon on the Argand diagram.
  • Sum of all $n$ roots $= 0$ (unless $n = 1$).
12

Differentiation & Value Trend

πŸ“˜ Value Trend Analysis (Curve Behavior):
  • First Derivative (monotonicity): $f'(x) > 0$ ⟢ increasing; $f'(x) < 0$ ⟢ decreasing. $f'(x) = 0$ isolates stationary points.
  • Second Derivative (concavity): $f''(x) > 0$ ⟢ concave up (accelerating); $f''(x) < 0$ ⟢ concave down (decelerating). $f''(x) = 0$ marks inflection points.
  • Stationary Points: $f'(x) = 0$. Use $f''(x)$: if $f''(x) > 0$ ⟢ local minimum; $f''(x) < 0$ ⟢ local maximum; $f''(x) = 0$ ⟢ test further.
  • End Behavior: Evaluate $\lim_{x \to \infty} f(x)$ and $\lim_{x \to -\infty} f(x)$ for long-range asymptotic trends.