[ \sum_k=1^n k \cdot 2^k = (n-1)2^n+1 + 2 ]
Prove by induction that for all ( n \in \mathbbZ^+ ): ib math aa hl past papers
Paper 3 often has lower boundaries (e.g., 65% for a 7) due to difficulty. | Topic | Key subtopics | |-------|----------------| | 1. Number & Algebra | Sequences, logs, complex numbers, binomial theorem, proof by induction, systems of equations | | 2. Functions | Domain/range, inverses, transformations, rational functions, modulus, odd/even | | 3. Trigonometry | Radians, unit circle, trig equations, reciprocal functions, inverse trig, trig identities, triangle solving | | 4. Vectors | Lines in 2D/3D, dot/cross product, angles, intersections, distances, planes | | 5. Calculus | Limits, differentiation rules, chain/product/quotient, implicit, related rates, curve sketching, optimization, integration (substitution, parts, partial fractions), differential equations, area/volume, Maclaurin series (HL only) | | 6. Probability & Stats | Bayes' theorem, probability distributions, binomial, Poisson (HL only), normal, expected value, variance | | 7. Proofs & Logic | Direct, contrapositive, contradiction, induction, counterexamples | Sample Past Paper Question (Paper 1 – No Calculator) Topic: Proof by induction + sequences [ \sum_k=1^n k \cdot 2^k = (n-1)2^n+1 +
