🇬🇧 Mathematics Admissions Test (MAT) · flashcards
Mathematics Admissions Test (MAT) Exponentials, Logarithms and Sequences Flashcards
49 question-and-answer cards covering Exponentials, Logarithms and Sequences as it is examined in Mathematics Admissions Test (MAT). 24 of them are printed below, taken from across the deck — no signup, no paywall on the preview.
24 sample cards from the Exponentials, Logarithms and Sequences deck
Sampled from the end of the deck, so these are different cards from the ones shown on the syllabus page.
Under what condition does an infinite geometric series converge, and what is its sum?
It converges when $|r| < 1$, and the sum to infinity is $S_{\infty} = \dfrac{a}{1 - r}$.
Find the sum to infinity of the geometric series $8 + 4 + 2 + 1 + \cdots$.
Here $a=8$, $r=\frac{1}{2}$, so $S_{\infty} = \dfrac{8}{1 - \frac{1}{2}} = 16$.
In a geometric progression, how is each term related to its neighbours (geometric mean property)?
The square of any term equals the product of its neighbours: $a_{n}^{2} = a_{n-1}\,a_{n+1}$, i.e. $a_{n} = \sqrt{a_{n-1}a_{n+1}}$.
In an arithmetic progression, how is each term related to its neighbours (arithmetic mean property)?
Each term is the average of its neighbours: $a_{n} = \dfrac{a_{n-1} + a_{n+1}}{2}$.
What is a recurrence relation (recursively defined sequence)?
A rule that defines each term using one or more previous terms together with initial value(s), e.g. $a_{n+1} = f(a_{n})$ with $a_{1}$ given.
Express an arithmetic sequence as a recurrence relation.
$a_{n+1} = a_{n} + d$, with $a_{1} = a$ given.
Express a geometric sequence as a recurrence relation.
$a_{n+1} = r\,a_{n}$, with $a_{1} = a$ given.
What is a fixed point (limit) of an iteration $x_{n+1} = f(x_{n})$, and how is it found?
A fixed point $L$ satisfies $L = f(L)$; if the iteration converges, its limit is found by solving this equation.
Define a periodic sequence and give the meaning of its order.
A sequence that repeats: $a_{n+k} = a_{n}$ for all $n$. The smallest such $k$ is the order (period) of the sequence.
What does the recurrence $x_{n+1} = \tfrac{1}{2}\!\left(x_{n} + \tfrac{N}{x_{n}}\right)$ converge to?
It converges to $\sqrt{N}$ (the Newton-Raphson / Babylonian iteration for square roots).
What does sigma notation $\sum_{r=1}^{n} a_{r}$ mean?
It denotes the sum $a_{1} + a_{2} + \cdots + a_{n}$; $r$ is the index, $1$ the lower limit and $n$ the upper limit.
Evaluate $\sum_{r=1}^{4} (2r + 1)$.
$(3) + (5) + (7) + (9) = 24$.
State the standard summation result for $\sum_{r=1}^{n} r$.
$\sum_{r=1}^{n} r = \dfrac{n(n+1)}{2}$.
State the standard summation result for $\sum_{r=1}^{n} r^{2}$.
$\sum_{r=1}^{n} r^{2} = \dfrac{n(n+1)(2n+1)}{6}$.
State the standard summation result for $\sum_{r=1}^{n} r^{3}$.
$\sum_{r=1}^{n} r^{3} = \dfrac{n^{2}(n+1)^{2}}{4} = \left(\dfrac{n(n+1)}{2}\right)^{2}$.
What is $\sum_{r=1}^{n} c$ where $c$ is a constant?
$\sum_{r=1}^{n} c = nc$ (the constant added $n$ times).
State the linearity property of sigma notation.
$\sum_{r=1}^{n} (\alpha a_{r} + \beta b_{r}) = \alpha\sum_{r=1}^{n} a_{r} + \beta\sum_{r=1}^{n} b_{r}$ for constants $\alpha,\beta$.
How can a sum starting from $r=k$ be expressed using sums starting from $r=1$?
$\sum_{r=k}^{n} a_{r} = \sum_{r=1}^{n} a_{r} - \sum_{r=1}^{k-1} a_{r}$.
Use standard results to find $\sum_{r=1}^{n} (r^{2} + r)$ in factored form.
$\sum_{r=1}^{n} r^{2} + \sum_{r=1}^{n} r = \dfrac{n(n+1)(2n+1)}{6} + \dfrac{n(n+1)}{2} = \dfrac{n(n+1)(n+2)}{3}$.
What is the noteworthy relationship between $\sum_{r=1}^{n} r^{3}$ and $\sum_{r=1}^{n} r$?
$\sum_{r=1}^{n} r^{3} = \left(\sum_{r=1}^{n} r\right)^{2}$; the sum of cubes equals the square of the sum of the first $n$ integers.
Compare the long-term behaviour of arithmetic versus geometric growth.
Arithmetic grows linearly (constant added each step), so it is unbounded but slow; geometric with $|r|>1$ grows exponentially and eventually dominates any arithmetic sequence.
How do you determine the number of terms $n$ in an arithmetic sequence given the last term $l$?
Use $l = a + (n-1)d$ and solve for $n$: $n = \dfrac{l - a}{d} + 1$.
How can a recurring decimal such as $0.\overline{27}$ be evaluated as an infinite geometric series?
$0.\overline{27} = \dfrac{27}{100} + \dfrac{27}{100^{2}} + \cdots = \dfrac{27/100}{1 - 1/100} = \dfrac{27}{99} = \dfrac{3}{11}$.
In compound-growth problems, how is the value after $n$ periods at rate $i$ modelled, and which type of sequence is it?
$A_{n} = A_{0}(1+i)^{n}$, a geometric sequence with first term $A_{0}$ and common ratio $r = 1+i$.
What this deck covers
The Exponentials, Logarithms and Sequences deck follows the Mathematics Admissions Test (MAT) Exponentials, Logarithms and Sequences syllabus — 3 chapters and 9 topics — so questions land on material that is genuinely examinable rather than trivia around it. That works out to roughly 16.3 cards per chapter.
Answers are written to be recallable, not just readable — averaging about 92 characters, which is long enough to carry the reasoning and short enough to say out loud.
A deck like this earns its keep on the second and third pass. Read the syllabus first so you know the shape of the subject, then use the cards to find the specific facts that have not stuck.
Exponentials, Logarithms and Sequences flashcards FAQ
How many Exponentials, Logarithms and Sequences flashcards are in this Mathematics Admissions Test (MAT) deck?
49 cards. This page previews 24 of them, sampled evenly across the deck so you can judge the difficulty before installing anything.
Are these Mathematics Admissions Test (MAT) flashcards free?
Yes. The preview here is free to read with no signup, and the full 49-card deck is free inside the Examius app.
What do the Exponentials, Logarithms and Sequences cards cover?
They follow the Mathematics Admissions Test (MAT) Exponentials, Logarithms and Sequences syllabus — 3 chapters and 9 topics — so the questions track what is actually examinable.
How should I use these flashcards?
Read the syllabus first so you know the shape of the subject, then drill the deck. Examius schedules each card with spaced repetition, so cards you keep missing come back sooner and ones you know drift further apart.