What is a sequence?
A sequence is an ordered list of numbers. Each number is a term, and its position is represented by its index.
Study 13/14 13. Sequences, Series, and Mathematical Modeling with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is a sequence?
A sequence is an ordered list of numbers. Each number is a term, and its position is represented by its index.
What does an explicit sequence formula provide?
An explicit formula gives a term directly from its position, so a distant term can be found without calculating all preceding terms.
What does a recursive formula require?
A recursive formula defines a term from preceding terms and must include an initial value to start the sequence.
How is an arithmetic sequence identified?
An arithmetic sequence has a constant difference between consecutive terms. This difference is called the common difference, d.
What is the explicit formula for an arithmetic sequence?
The explicit formula is an=a1+(n−1)d, where a1 is the first term and d is the common difference.
If a4=18 and a10=42, what is d?
For an arithmetic sequence, d=10−4a10−a4=642−18=4.
How is a geometric sequence identified?
A geometric sequence has a constant ratio between consecutive nonzero terms. Its explicit formula is an=a1rn−1.
Is 4,9,14,19,… arithmetic or geometric?
The sequence 4,9,14,19,… is arithmetic because its common difference is 5.
What is the sum formula for an arithmetic series?
The sum of the first n terms is Sn=2n(a1+an).
What is the finite geometric-series sum formula?
For r=1, the sum of the first n geometric terms is Sn=a11−r1−rn.
When does an infinite geometric series have a finite sum?
An infinite geometric series converges to a finite sum exactly when ∣r∣<1. In that case, S∞=1−ra1.
How is a percentage rate converted to an exponential factor?
For growth at percentage rate p, use the growth factor b=1+p. For decay, use b=1−p, with p written as a decimal.
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A medium-difficulty quiz on relations, relation properties, equivalence relations, partial orders, functions, injectivity, surjectivity, bijections, and inverse functions. The questions emphasize applying definitions to examples and interpreting mathematical structure.
A progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A 14-question quiz on mathematical induction, strong induction, well-ordering, recursive definitions, and structural induction. Questions progress from introductory recognition to medium-difficulty application and proof reasoning.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A medium-difficulty quiz on advanced counting methods, including binomial coefficients, stars and bars, the binomial theorem, inclusion-exclusion, recurrences, tilings, derangements, and characteristic equations.
A progressive guide to choosing and applying binomial coefficients, the binomial theorem, inclusion-exclusion, and recurrence relations in advanced counting problems.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
A medium-difficulty quiz on sequences, summation techniques, recurrence relations, characteristic roots, generating functions, and recursive algorithms. Questions progress from foundational applications to more involved reasoning.
A structured guide to describing sequences, simplifying sums, modeling and solving recurrence relations, using generating functions, and analyzing recursive algorithms.