Suggested pacing
Use approximately 15 sessions: concept development, guided practice, application, error analysis, mastery, corrections, and project evidence. Adjust by demonstrated mastery rather than age.
Instruction, differentiation, and records
Sequences, Series & the Binomial Theorem
How do recursive and explicit rules describe patterns, accumulated change, and finite or infinite sums?
Three pathways
Foundation: prerequisite retrieval, scaffolded steps, tables and graphs. Core: complete unit targets. Extended: proof, parameter analysis, modelling, and pre-calculus connections.
Assessment evidence
Use lesson checks, practice explanations, the randomized mastery check, corrections, project rubric, oral explanation, and representative work together. Do not infer mastery from one score alone.
Key misconception
Using n instead of n−1 in the explicit formula.
Require the learner to identify the first invalid step and provide a rule, verification, or counterexample.
Standards categories
Sequences, Series, Recursive Functions, Binomial Theorem. The course-wide standards union and local-reporting disclaimer are in STANDARDS_UNION.md.