Chapter 37 The Sequential Ascent

Chapter 37: Sequences and Elementary Recursion in Dr Richard Murdoch Montgomery's mathematical treatise introduces the study of ordered lists of numbers, bridging discrete input-output mappings with step-by-step growth patterns and recursive structures. The chapter is structured around five core pillars: Sequences as Discrete Functions: Defines a sequence as a specialized class of functions whose domain consists strictly of positive integers, establishing a clear conceptual distinction between a term's positional address or index and the actual numerical value assigned to that position. Arithmetic Sequences and Constant Additive Growth: Focuses on sequences generated by adding a fixed, constant value—the common difference—to each term to produce the next. It derives explicit rules for calculating any distant term directly without listing intermediate values and demonstrates how pairing terms from opposite ends reveals a straightforward method for summing finite arithmetic lists. Geometric Sequences and Multiplicative Scaling: Details sequences generated by multiplying each term by a fixed constant ratio. It explores how constant multiplicative factors cause terms to expand rapidly or decay steadily toward zero, deriving explicit position rules and finite sum formulas through systematic algebraic shifting and cancellation techniques. Elementary Recursion and Recurrence Relations: Introduces recursive definitions, where future terms are defined directly by operating on one or more preceding terms rather than through an explicit position formula. It highlights famous recurrence patterns, such as the Fibonacci sequence, where each new term is produced by summing the two terms immediately before it. Discrete Modeling in Science and Finance: Applies sequence models to real-world scenarios that unfold in distinct, step-by-step intervals, such as scheduled loan repayments, periodic savings deposits, generational population counts, and iterative computational algorithms.