Two terms of an AP give two equations in a and d.
a + 15d = 73 (2)
(2) – (1): 5d = 35, so d = 7
From (1): a = 38 – 70 = –32
t31 = a + 30d = –32 + 210 = 178
Shorter: t31 is 15 steps past t16, so t31 = 73 + 15 × 7 = 73 + 105 = 178. ✓
Book page 194–195 Updated on2026-09-08
Two terms of an AP give two equations in a and d.
Shorter: t31 is 15 steps past t16, so t31 = 73 + 15 × 7 = 73 + 105 = 178. ✓
"The 7th term exceeds the 5th by 12" means t7 – t5 = 12, and those two terms are two steps apart.
The AP is 4, 10, 16, 22, 28, 34, 40, …
Check: the 3rd term is 16 ✓; t7 = 40 and t5 = 28, and 40 – 28 = 12 ✓.
Find the two ends first.
These form an AP with a = 105, d = 7, last term 994.
There are 128 three-digit numbers divisible by 7.
The multiples of 4 strictly between 10 and 250 run from 12 to 248.
There are 60 multiples of 4 between 10 and 250.
Let the GP be a, ar, ar2, … Translate both conditions.
Case r = 2: a(1 + 2) = –4 gives 3a = –4, a = –4/3.
Case r = –2: a(1 – 2) = –4 gives –a = –4, a = 4.
Both are valid answers: –4/3, –8/3, –16/3, … and 4, –8, 16, –32, …
Suppose the sum has k terms starting at a. Using the AP sum idea, the total is k terms whose average is (first + last)/2:
Now k and (2a + k – 1) are two factors of 200. They always have opposite parity: if k is odd, k – 1 is even so 2a + k – 1 is even, and vice versa. So one factor must be odd. The odd factors of 200 = 23 × 52 are 1, 5 and 25.
| k | 2a + k – 1 | a | Valid? |
|---|---|---|---|
| 1 | 200 | 100 | the single number 100 — not a sum |
| 5 | 40 | (40 – 4)/2 = 18 | yes |
| 8 | 25 | (25 – 7)/2 = 9 | yes |
| 25 | 8 | negative | rejected |
| 40 | 5 | negative | rejected |
| 200 | 1 | negative | rejected |
Both check out: 18 + 22 = 40, and 5 terms averaging 20 give 100; 9 + 16 = 25, and 8 terms averaging 12.5 give 100. So there are exactly two ways (three, if the single number 100 is allowed to count).
Doubling every hour is a GP with a = 30 and r = 2, counting from hour 0.
Write each term as a + (n – 1)d and add.
The first three terms are –13, –8, –3.
Check: t4 = –13 + 15 = 2 and t8 = –13 + 35 = 22, sum 24 ✓. t6 = –13 + 25 = 12 and t10 = –13 + 45 = 32, sum 44 ✓.
Require Sn = n(n + 1)/2 > 1000, that is n(n + 1) > 2000.
So the smallest such value is n = 45, giving S45 = 1035 > 1000, while S44 = 990 < 1000.
a = 2 and r = 8 ÷ 2 = 4 (also 32 ÷ 8 = 4).
Solve tn = 131072 by turning everything into powers of 2:
So 131072 is the 9th term. Check: 2 × 48 = 2 × 65536 = 131072. ✓
Choosing the three terms as a/r, a, ar makes the product collapse.
Now use the sum:
Factorise: 12r2 + 16r + 9r + 12 = 4r(3r + 4) + 3(3r + 4) = (3r + 4)(4r + 3).
With a = –1 and r = –3/4 the three terms are a/r = 4/3, a = –1, ar = 3/4:
The other root r = –4/3 gives the same three numbers in reverse order: 3/4, –1, 4/3.
Let the GP have first term a and common ratio r.
Compare the two ratios of consecutive members of x, y, z:
The ratio of consecutive terms is the same constant, so x, y, z form a GP with common ratio r6. Equivalently y2 = a2r18 = (ar3)(ar15) = xz, which is the same statement.
Let the terms be a, ar, ar2.
The key is the identity 1 + r2 + r4 = (1 + r + r2)(1 – r + r2). Substituting into (2):
Subtract (3) from (1), then add them:
Put a = 6/r into a + ar2 = 20:
With r = 3, ar = 6 gives a = 2, so the terms are 2, 6, 18. With r = 1/3 they are 18, 6, 2 — the same three numbers reversed.
Each term is 1 more than the sum of everything before it.
So the values are 1, 2, 4, 8, 16, 32, 64, 128.
A simpler recursive formula. Compare two consecutive terms, for n > 3:
This also holds at n = 3, since P3 = 4 = 2 × 2 = 2P2. So P1 = 1, Pn = 2Pn–1 for n ≥ 2 — a GP with a = 1 and r = 2.
Note that this sum stops at Wn–2, not Wn–1 — it leaves out the term immediately before.
The sequence is 1, 2, 3, 5, 8, 13, 21, 34 — the Virahānka–Fibonacci sequence.
Here is why, and not merely that it looks familiar. Subtract the rule at n – 1 from the rule at n:
With W1 = 1 and W2 = 2 this is exactly the rule Vn = Vn–1 + Vn–2 of page 179, so the two sequences are the same one.