HSC Sequences: Study Guide & Outline

The introduction outlines the scope and pedagogical approach of the booklet. It describes the target audience as HSC Extension students seeking to master sequences and series, including advanced applications like telescoping sums, iterative dynamics, and generating functions. The 'How to Use' section advises a learn-by-doing approach: review fundamentals, then progress through detailed worked solutions in Part 1 and practice problems in Part 2. Topics covered span basic $n$th term and sum problems, infinite geometric series, recurrence relations, Chebyshev polynomials, and links to discrete calculus. The section also previews where this leads next, hinting at connections to calculus, complex numbers, and proof techniques.

This section revises essential concepts: how sequences are defined (explicit formulas, recurrence), arithmetic and geometric sequences and series, sum formulas, the limiting sum of a GP, recurring decimals as fractions, convergence theorems, and sigma/pi notation. Key results include $S_n = \frac{n}{2}(2a+(n-1)d)$ for AP sums, $S_n = a\frac{1-r^n}{1-r}$ for GP sums, and $S_\infty = \frac{a}{1-r}$ for $|r|<1$. Worked mini-problems (e.g., recognizing AP/GP, computing sums) reinforce these. The convergence theorems cover monotone bounded sequences and the algebra of limits. Recurring decimals are expressed as infinite geometric series. Sigma notation rules and index shifts are reviewed to prepare students for telescoping sums and formal manipulations.

This core section presents 16 fully solved problems in three tiers: Basic (5), Medium (6), Advanced (5). Basic problems cover AP nth term, common ratio, AP sum, recurring decimal to fraction, and a Chebyshev recurrence of the first kind. Medium problems include mixed AP constraints, finite GP with unknown $n$, financial sequences (compound interest, loan repayments), telescoping sums with induction, binomial coefficient partial sums, and recursive geometry of Chebyshev sequences. Advanced problems tackle recursive sequences with limiting values (fixed point iteration), dynamics of iteration (cobweb diagrams), harmonic means and geometry, Chebyshev composition identities, and sigma sum bounding techniques. Each solution is a full, step-by-step model with clear reasoning, emphasising problem-solving strategies: choosing the right formula, manipulating indices, transforming to standard forms, using algebraic and geometric insights, and checking conditions (e.g., $|r|<1$ for infinite sums).

This section provides 29 additional problems (8 Basic, 8 Medium, 13 Advanced) with concise hints and abbreviated solutions, designed for independent practice. Basic problems include quick AP term, GP sum, Chebyshev values, arithmetic pricing model, simple interest, recurring decimal to fraction, nested shaded squares, and a fraction of a recurring decimal. Medium problems involve sigma indexing shifts, infinite geometric interpretation, second-kind Chebyshev recurrence, alternative telescoping patterns (including surd telescoping), central symmetry in a GP, Fibonacci/Lucas numbers, and linear combinations of two GPs. Advanced problems cover convergence conditions, AP and GP crossover (mixed sequences), Chebyshev roots, architecture of GP sums, AP space and the difference operator (discrete calculus), basis and projection in AP space, countable/uncountable sets, prime denominators and cycle length (recurring decimals), Pythagorean means, modular structure of recurring decimals, arithmetico-geometric sums (Sissa story), discrete calculus for power sums, and the Fibonacci generating function. The hints nudge students toward key insights without giving full solutions, building independence.

The conclusion synthesises the booklet's journey from fundamental definitions to sophisticated applications. It reflects on the progression from AP/GP basics to advanced concepts like Chebyshev polynomials, iteration dynamics, and generating functions, underscoring the depth of sequences in the HSC syllabus. It encourages students to revisit problems, extend ideas, and see connections to other areas like calculus and complex numbers. The booklet's problem-solving framework is emphasised: understand the structure, apply appropriate tools, and verify conditions.

The appendices provide quick-reference materials: Appendix A is a formula sheet listing all key formulas for AP, GP, sigma notation, telescoping sums, Chebyshev recurrences, and generating functions. Appendix B warns of common sequence traps: confusing $n$ in sum formulas, forgetting $|r|<1$, misapplying convergence tests, incorrect sigma index shifts. Appendix C gives a rigorous $\varepsilon$-$N$ definition of convergence and proves basic limit theorems. Appendix D introduces limit superior and inferior for sequences that oscillate, linking to HSC Extension 2 content. Appendix E covers discrete calculus and the difference operator $\Delta a_n = a_{n+1}-a_n$, including factorial powers, summation by parts, and sums of powers, connecting to the AP space problems in Part 2.