Professional Documents
Culture Documents
Version 0
September 17, 2008
ii
iii
STOP!!!!
FHSST Editors
Jaynie Padayachee ; Joanne Boulle ; Diana Mulcahy ; Annette Nell ; René Toerien ; Donovan
Whitfield
FHSST Contributors
Rory Adams ; Prashant Arora ; Richard Baxter ; Dr. Sarah Blyth ; Sebastian Bodenstein ;
Graeme Broster ; Richard Case ; Brett Cocks ; Tim Crombie ; Dr. Anne Dabrowski ; Laura
Daniels ; Sean Dobbs ; Fernando Durrell ; Dr. Dan Dwyer ; Frans van Eeden ; Giovanni
Franzoni ; Ingrid von Glehn ; Tamara von Glehn ; Lindsay Glesener ; Dr. Vanessa Godfrey ; Dr.
Johan Gonzalez ; Hemant Gopal ; Umeshree Govender ; Heather Gray ; Lynn Greeff ; Dr. Tom
Gutierrez ; Brooke Haag ; Kate Hadley ; Dr. Sam Halliday ; Asheena Hanuman ; Neil Hart ;
Nicholas Hatcher ; Dr. Mark Horner ; Mfandaidza Hove ; Robert Hovden ; Jennifer Hsieh ;
Clare Johnson ; Luke Jordan ; Tana Joseph ; Dr. Jennifer Klay ; Lara Kruger ; Sihle Kubheka ;
Andrew Kubik ; Dr. Marco van Leeuwen ; Dr. Anton Machacek ; Dr. Komal Maheshwari ;
Kosma von Maltitz ; Nicole Masureik ; John Mathew ; JoEllen McBride ; Nikolai Meures ;
Riana Meyer ; Jenny Miller ; Abdul Mirza ; Asogan Moodaly ; Jothi Moodley ; Nolene Naidu ;
Tyrone Negus ; Thomas O’Donnell ; Dr. Markus Oldenburg ; Dr. Jaynie Padayachee ;
Nicolette Pekeur ; Sirika Pillay ; Jacques Plaut ; Andrea Prinsloo ; Joseph Raimondo ; Sanya
Rajani ; Prof. Sergey Rakityansky ; Alastair Ramlakan ; Razvan Remsing ; Max Richter ; Sean
Riddle ; Evan Robinson ; Dr. Andrew Rose ; Bianca Ruddy ; Katie Russell ; Duncan Scott ;
Helen Seals ; Ian Sherratt ; Roger Sieloff ; Bradley Smith ; Greg Solomon ; Mike Stringer ;
Shen Tian ; Robert Torregrosa ; Jimmy Tseng ; Helen Waugh ; Dr. Dawn Webber ; Michelle
Wen ; Dr. Alexander Wetzler ; Dr. Spencer Wheaton ; Vivian White ; Dr. Gerald Wigger ;
Harry Wiggins ; Wendy Williams ; Julie Wilson ; Andrew Wood ; Emma Wormauld ; Sahal
Yacoob ; Jean Youssef
Contributors and editors have made a sincere effort to produce an accurate and useful resource.
Should you have suggestions, find mistakes or be prepared to donate material for inclusion,
please don’t hesitate to contact us. We intend to work with all who are willing to help make
this a continuously evolving resource!
www.fhsst.org
v
vi
Contents
I Basics 1
1 Introduction to Book 3
1.1 The Language of Mathematics . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
II Grade 10 5
4 Exponentials - Grade 10 29
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
4.2 Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
4.3 Laws of Exponents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
4.3.1 Exponential Law 1: a0 = 1 . . . . . . . . . . . . . . . . . . . . . . . . . 30
4.3.2 Exponential Law 2: am × an = am+n . . . . . . . . . . . . . . . . . . . 30
1
4.3.3 Exponential Law 3: a−n = an , a 6= 0 . . . . . . . . . . . . . . . . . . . . 31
4.3.4 Exponential Law 4: a ÷ a = am−n . . . . . . . . . . . . . . . . . . . 32
m n
8 Finance - Grade 10 53
8.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
8.2 Foreign Exchange Rates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
8.2.1 How much is R1 really worth? . . . . . . . . . . . . . . . . . . . . . . . 53
8.2.2 Cross Currency Exchange Rates . . . . . . . . . . . . . . . . . . . . . . 56
8.2.3 Enrichment: Fluctuating exchange rates . . . . . . . . . . . . . . . . . . 57
8.3 Being Interested in Interest . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
viii
CONTENTS CONTENTS
IV Grade 12 443
V Exercises 613
xx
Chapter 36
36.1 Introduction
In this chapter we extend the arithmetic and quadratic sequences studied in earlier grades, to
geometric sequences. We also look at series, which is the summing of the terms in a sequence.
For example,
1,2,3,4,5,6, . . .
is an arithmetic sequence because you add 1 to the current term to get the next term:
first term: 1
second term: 2=1+1
third term: 3=2+1
..
.
nth term: n = (n − 1) + 1
457
36.2 CHAPTER 36. SEQUENCES AND SERIES - GRADE 12
More formally, the number we start out with is called a1 (the first term), and the difference
between each successive term is denoted d, called the common difference.
a1 = a1
a2 = a1 + d
a3 = a2 + d = (a1 + d) + d = a1 + 2d
a4 = a3 + d = (a1 + 2d) + d = a1 + 3d
...
an = a1 + d · (n − 1)
an = a1 + d · (n − 1) (36.1)
Given a1 and the common difference, d, the entire set of numbers belonging to an arithmetic
sequence can be generated.
an = an−1 + d (36.2)
where
• an represents the new term, the nth -term, that is calculated;
• an−1 represents the previous term, the (n − 1)th -term;
• d represents some constant.
A simple test for an arithmetic sequence is to check that the difference between consecutive
terms is constant:
a2 − a1 = a3 − a2 = an − an−1 = d (36.3)
This is quite an important equation, and is the definitive test for an arithmetic sequence. If this
condition does not hold, the sequence is not an arithmetic sequence.
a9 an = a1 + d(n − 1)
a8 b
a7 b
a6 b
Term, an a5 b gradient d
a4 b
a3 b
a2 b
a1 b y-intercept, a1
1 2 3 4 5 6 7 8 9
Index, n
This means that the ratio between consecutive numbers in the geometric sequence is a constant.
We will explain what we mean by ratio after looking at the following example.
Assume that you have the flu virus, and you forgot to cover your mouth when two friends came
to visit while you were sick in bed. They leave, and the next day they also have the flu. Let’s
assume that they in turn spread the virus to two of their friends by the same droplet spread the
following day. Assuming this pattern continues and each sick person infects 2 other friends, we
can represent these events in the following manner:
Again we can tabulate the events and formulate an equation for the general case:
459
36.3 CHAPTER 36. SEQUENCES AND SERIES - GRADE 12
Figure 36.1: Each person infects two more people with the flu virus.
The above table represents the number of newly-infected people after n days since you first
infected your 2 friends.
You sneeze and the virus is carried over to 2 people who start the chain (a1 = 2). The next day,
each one then infects 2 of their friends. Now 4 people are newly-infected. Each of them infects
2 people the third day, and 8 people are infected, and so on. These events can be written as a
geometric sequence:
2; 4; 8; 16; 32; . . .
Note the common factor (2) between the events. Recall from the linear arithmetic sequence
how the common difference between terms were established. In the geometric sequence we can
determine the common ratio, r, by
a2 a3
= =r (36.4)
a1 a2
From the above example we know a1 = 2 and r = 2, and we have seen from the table that the
nth -term is given by an = 2 × 2n−1 . Thus, in general,
an = a1 · rn−1 (36.6)
an = a1 · rn−1
a10 = 2 × 210−1
= 2 × 29
= 2 × 512
= 1024
an = a1 · rn−1
16 384 = 2 × 2n−1
16 384 ÷ 2 = 2n−1
8 192 = 2n−1
213 = 2n−1
13 = n − 1
n = 14
36.3.3 Exercises
1. What is the important characteristic of an arithmetic sequence?
461
36.4 CHAPTER 36. SEQUENCES AND SERIES - GRADE 12
2. Write down how you would go about finding the formula for the nth term of an arithmetic
sequence?
3. A single square is made from 4 matchsticks. Two squares in a row needs 7 matchsticks
and 3 squares in a row needs 10 matchsticks. Determine:
an = an−1 + d
The above equation is an example of a recursive equation since we can calculate the nth -term
only by considering the previous term in the sequence. Compare this with equation (36.1),
an = a1 + d · (n − 1) (36.7)
where one can directly calculate the nth -term of an arithmetic sequence without knowing previous
terms.
For quadratic sequences, we noticed the difference between consecutive terms is given by (??):
an − an−1 = D · (n − 2) + d
an = an−1 + D · (n − 2) + d (36.8)
which is then a recursive equation for a quadratic sequence with common second difference, D.
Using (36.5), the recursive equation for a geometric sequence is:
an = r · an−1 (36.9)
Recursive equations are extremely powerful: you can work out every term in the series just by
knowing previous terms. As you can see from the examples above, working out an using the
previous term an−1 can be a much simpler computation than working out an from scratch using
a general formula. This means that using a recursive formula when using a computer to work
out a sequence would mean the computer would finish its calculations significantly quicker.
462
CHAPTER 36. SEQUENCES AND SERIES - GRADE 12 36.5
The above sequence is called the Fibonacci sequence. Each new term is calculated
by adding the previous two terms. Hence, we can write down the recursive equation:
36.5 Series
In this section we simply work on the concept of adding up the numbers belonging to arithmetic
and geometric sequences. We call the sum of any sequence of numbers a series.
If we add up the terms of a sequence, we obtain what is called a series. If we only sum a finite
amount of terms, we get a finite series. We use the symbol Sn to mean the sum of the first n
terms of a sequence {a1 ; a2 ; a3 ; . . . ; an }:
S n = a1 + a2 + a3 + . . . + an (36.12)
and we wish to find the sum of the first 4 terms, then we write
S4 = 1 + 4 + 9 + 25 = 39
The above is an example of a finite series since we are only summing 4 terms.
If we sum infinitely many terms of a sequence, we get an infinite series:
S ∞ = a1 + a2 + a3 + . . . (36.13)
In the case of an infinite series, the number of terms is unknown and simply increases to ∞.
In this section we introduce a notation that will make our lives a little easier.
463
36.5 CHAPTER 36. SEQUENCES AND SERIES - GRADE 12
P
A sum may be written out using the summation symbol . This symbol is sigma, which is the
capital letter “S” in the Greek alphabet. It indicates that you must sum the expression to the
right of it:
Xn
ai = am + am+1 + . . . + an−1 + an (36.14)
i=m
where
• m is the lower bound (or start index), shown below the summation symbol;
• n is the upper bound (or end index), shown above the summation symbol;
we have to add together all the terms in the sequence ai = i from i = 1 up until i = 5:
5
X
i = 1 + 2 + 3 + 4 + 5 = 15
i=1
Examples
1.
6
X
2i = 21 + 22 + 23 + 24 + 25 + 26
i=1
= 2 + 4 + 8 + 16 + 32 + 64
= 126
2.
10
X
(3xi ) = 3x3 + 3x4 + . . . + 3x9 + 3x10
i=3
464
CHAPTER 36. SEQUENCES AND SERIES - GRADE 12 36.6
2. For any constant c, which is any variable not dependent on the index i,
n
X
c · ai = c · a1 + c · a2 + c · a3 + . . . + c · an
i=1
= c (a1 + a2 + a3 + . . . + an )
Xn
= c ai (36.17)
i=1
Exercises
4
P
1. What is 2?
k=1
3
P
2. Determine i.
i=−1
5
P
3. Expand i.
k=0
Remember that an arithmetic sequence is a set of numbers, such that the difference between
any term and the previous term is a constant number, d, called the constant difference:
an = a1 + d (n − 1) (36.18)
where
When we sum a finite number of terms in an arithmetic sequence, we get a finite arithmetic
series.
The simplest arithmetic sequence is when a1 = 1 and d = 0 in the general form (36.18); in other
words all the terms in the sequence are 1:
ai = a1 + d (i − 1)
= 1 + 0 · (i − 1)
= 1
{ai } = {1; 1; 1; 1; 1; . . .}
If we wish to sum this sequence from i = 1 to any positive integer n, we would write
n
X n
X
ai = 1 = 1 + 1 + 1 + ...+ 1 (n times)
i=1 i=1
465
36.6 CHAPTER 36. SEQUENCES AND SERIES - GRADE 12
Since all the terms are equal to 1, it means that if we sum to n we will be adding n-number of
1’s together, which is simply equal to n:
n
X
1=n (36.19)
i=1
Another simple arithmetic sequence is when a1 = 1 and d = 1, which is the sequence of positive
integers:
ai = a1 + d (i − 1)
= 1 + 1 · (i − 1)
= i
{ai } = {1; 2; 3; 4; 5; . . .}
If we wish to sum this sequence from i = 1 to any positive integer n, we would write
n
X
i = 1 + 2 + 3 + ...+ n (36.20)
i=1
This is an equation with a very important solution as it gives the answer to the sum of positive
integers.
teresting Mathematician, Karl Friedrich Gauss, discovered this proof when he was only
Interesting
Fact
Fact 8 years old. His teacher had decided to give his class a problem which would
distract them for the entire day by asking them to add all the numbers from 1
to 100. Young Karl realised how to do this almost instantaneously and shocked
the teacher with the correct answer, 5050.
Sn = 1 + 2 + . . . + (n − 1) + n (36.21)
We then write the same sum but with the terms in descending order:
Sn = n + (n − 1) + . . . + 2 + 1 (36.22)
We then add corresponding pairs of terms from equations (36.21) and (36.22), and we find that
the sum for each pair is the same, (n + 1):
2 Sn = (n + 1) + (n + 1) + . . . + (n + 1) + (n + 1) (36.23)
We then have n-number of (n + 1)-terms, and by simplifying we arrive at the final result:
2 Sn = n (n + 1)
n
Sn = (n + 1)
2
n
X n
Sn = i= (n + 1) (36.24)
i=1
2
general formula for an arithmetic sequence and sum it from i = 1 to any positive integer n:
n
X n
X
ai = [a1 + d (i − 1)]
i=1 i=1
Xn
= (a1 + di − d)
i=1
Xn
= [(a1 − d) + di]
i=1
Xn n
X
= (a1 − d) + (di)
i=1 i=1
Xn n
X
= (a1 − d) + d i
i=1 i=1
dn
= (a1 − d) n + (n + 1)
2
n
= (2a1 − 2d + dn + d)
2
n
= (2a1 + dn − d)
2
n
= [ 2a1 + d (n − 1) ]
2
So, the general formula for determining an arithmetic series is given by
n
X n
Sn = [ a1 + d (i − 1) ] = [ 2a1 + d (n − 1) ] (36.25)
i=1
2
For example, if we wish to know the series S20 for the arithmetic sequence ai = 3 + 7 (i − 1),
we could either calculate each term individually and sum them:
20
X
S20 = [3 + 7 (i − 1)]
i=1
= 3 + 10 + 17 + 24 + 31 + 38 + 45 + 52 +
59 + 66 + 73 + 80 + 87 + 94 + 101 +
108 + 115 + 122 + 129 + 136
= 1390
or, more sensibly, we could use equation (36.25) noting that a1 = 3, d = 7 and n = 20 so that
20
X
S20 = [3 + 7 (i − 1)]
i=1
20
= 2 [2 · 3 + 7 (20 − 1)]
= 1390
36.6.2 Exercises
n
1. The sum to n terms of an arithmetic series is Sn = (7n + 15).
2
A How many terms of the series must be added to give a sum of 425?
B Determine the 6th term of the series.
2. The sum of an arithmetic series is 100 times its first term, while the last term is 9 times
the first term. Calculate the number of terms in the series if the first term is not equal to
zero.
467
36.7 CHAPTER 36. SEQUENCES AND SERIES - GRADE 12
3. The common difference of an arithmetic series is 3. Calculate the values of n for which
the nth term of the series is 93, and the sum of the first n terms is 975.
4. The sum of n terms of an arithmetic series is 5n2 − 11n for all values of n. Determine the
common difference.
5. The sum of an arithmetic series is 100 times the value of its first term, while the last term
is 9 times the first term. Calculate the number of terms in the series if the first term is
not equal to zero.
6. The third term of an arithmetic sequence is -7 and the 7t h term is 9. Determine the sum
of the first 51 terms of the sequence.
8. The common difference of an arithmetic series is 3. Calculate the values of n for which
the nth term of the series is 93 and the sum of the first n terms is 975.
When we sum a finite number of terms in a quadratic sequence, we get a finite quadratic series.
The general form of a quadratic series is quite complicated, so we will only look at the simple
case when D = 2 and d = (a2 − a1 ) = 3 in the general form (???). This is the sequence of
squares of the integers:
ai = i2
{ai } = {12 ; 22 ; 32 ; 42 ; 52 ; 62 ; . . .}
= {1; 4; 9; 16; 25; 36; . . .}
n
X n
Sn = i2 = (2n + 1)(n + 1) (36.26)
i=1
6
The proof for equation (36.26) can be found under the Advanced block that follows:
3
We start off with the expansion of (k + 1) .
(k + 1)3 = k 3 + 3k 2 + 3k + 1
(k + 1)3 − k 3 = 3k 2 + 3k + 1
468
CHAPTER 36. SEQUENCES AND SERIES - GRADE 12 36.8
1 3 3 3
= (n + 3n2 + 3n − n2 − n − n)
3 2 2
1 3 3 2 1
= (n + n + n)
3 2 2
n
= (2n2 + 3n + 1)
6
Therefore,
n
X n
i2 = (2n + 1)(n + 1)
i=1
6
By simply adding together the first n terms, we are actually writing out the series
You may notice that all the terms on the right side of (36.28) and (36.29) are the same, except
the first and last terms. If we subtract (36.28) from (36.29), we are left with just
rSn − Sn = a1 rn − a1
Sn (r − 1) = a1 (rn − 1)
n
X a1 (rn − 1)
Sn = a1 · ri−1 = (36.30)
i=1
r−1
36.8.1 Exercises
1. Prove that
a (1 − rn )
a + ar + ar2 + ... + arn−1 =
(1 − r)
3 3
2. Find the sum of the first 11 terms of the geometric series 6 + 3 + 2 + 4 + ...
3. Show that the sum of the first n terms of the geometric series
54 + 18 + 6 + ... + 5 ( 31 )n−1
is given by 81 − 34−n .
4. The eighth term of a geometric sequence is 640. The third term is 20. Find the sum of
the first 7 terms.
n
8 ( 21 )t = 15 43 .
P
5. Solve for n:
t=1
6. The ratio between the sum of the first three terms of a geometric series and the sum of
the 4th -, 5th − and 6th -terms of the same series is 8 : 27. Determine the common ratio
and the first 2 terms if the third term is 8.
9. Determine:
4
X
3 · 2n−1
n=1
470
CHAPTER 36. SEQUENCES AND SERIES - GRADE 12 36.9
Thus far we have been working only with finite sums, meaning that whenever we determined the
sum of a series, we only considered the sum of the first n terms. In this section, we consider
what happens when we add infinitely many terms together. You might think that this is a silly
question - surely the answer will be ∞ when one sums infinitely many numbers, no matter how
small they are? The surprising answer is that in some cases one will reach ∞ (like when you
try to add all the positive integers together), but in some cases one will get a finite answer.
If you don’t believe this, try doing the following sum, a geometric series, on your calculator or
computer:
1 1 1 1 1
2 + 4 + 8 + 16 + 32 + . . .
You might think that if you keep adding more and more terms you will eventually get larger and
larger numbers, but in fact you won’t even get past 1 - try it and see for yourself!
We denote the sum of an infinite number of terms of a sequence by
∞
X
S∞ = ai
i=1
When we sum the terms of a series, and the answer we get after each summation gets closer
and closer to some number, we say that the series converges. If a series does not converge, then
we say that it diverges.
There is a simple test for knowing instantly which geometric series converges and which diverges.
When r, the common ratio, is strictly between -1 and 1, i.e. −1 < r < 1, the infinite series
will converge, otherwise it will diverge. There is also a formula for working out what the series
converges to.
Let’s start off with formula (36.30) for the finite geometric series:
n
X a1 (rn − 1)
Sn = a1 · ri−1 =
i=1
r−1
n = 1 : rn = r1 = ( 12 )1 = 1
2
n = 2 : rn = r2 = ( 12 )2 = 1
2 · 1
2 = 1
4 < 1
2
n = 3 : rn = r3 = ( 12 )3 = 1
2 · 1
2 · 1
2 = 1
8 < 1
4
∞
X a1
S∞ = a1 .ri−1 = for −1 (36.31)
i=1
1−r
where a1 is the first term of the series and r is the common ratio.
36.9.2 Exercises
1. What does ( 52 )n approach as n tends towards ∞?
1 1
2. Find the sum to infinity of the geometric series 3 + 1 + 3 + 9 + ...
3. Determine for which values of x, the geometric series
2+ 2
3 (x + 1) + 2
9 (x + 1)2 + . . .
will converge.
4. The sum to infinity of a geometric series with positive terms is 4 61 and the sum of the first
two terms is 2 32 . Find a, the first term, and r, the common ratio between consecutive
terms.
8. A new soccer competition requires each of 8 teams to play every other team once.
A Calculate the total number of matches to be played in the competition.
472
CHAPTER 36. SEQUENCES AND SERIES - GRADE 12 36.10
B If each of n teams played each other once, determine a formula for the total number
of matches in terms of n.
9. The midpoints of the sides of square with length equal to 4 units are joined to form a
new square. The process is repeated indefinitely. Calculate the sum of the areas of all the
squares so formed.
10. Thembi worked part-time to buy a Mathematics book which cost R29,50. On 1 February
she saved R1,60, and saves everyday 30 cents more than she saved the previous day. (So,
on the second day, she saved R1,90, and so on.) After how many days did she have enough
money to buy the book?
11. Consider the geometric series:
5 + 2 12 + 1 14 + . . .
A If A is the sum to infinity and B is the sum of the first n terms, write down the value
of:
i. A
ii. B in terms of n.
1
B For which values of n is (A − B) < 24 ?
12. A certain plant reaches a height of 118 mm after one year under ideal conditions in a
greenhouse. During the next year, the height increases by 12 mm. In each successive year,
the height increases by 85 of the previous year’s growth. Show that the plant will never
reach a height of more than 150 mm.
n
P
13. Calculate the value of n if (20 − 4a) = −20.
a=1
14. Michael saved R400 during the first month of his working life. In each subsequent month,
he saved 10% more than what he had saved in the previous month.
A How much did he save in the 7th working month?
B How much did he save all together in his first 12 working months?
C In which month of his working life did he save more than R1,500 for the first time?
15. A man was injured in an accident at work. He receives a disability grant of R4,800 in the
first year. This grant increases with a fixed amount each year.
A What is the annual increase if, over 20 years, he would have received a total of
R143,500?
B His initial annual expenditure is R2,600 and increases at a rate of R400 per year.
After how many years does his expenses exceed his income?
16. The Cape Town High School wants to build a school hall and is busy with fundraising. Mr.
Manuel, an ex-learner of the school and a successful politician, offers to donate money to
the school. Having enjoyed mathematics at school, he decides to donate an amount of
money on the following basis. He sets a mathematical quiz with 20 questions. For the
correct answer to the first question (any learner may answer), the school will receive 1
cent, for a correct answer to the second question, the school will receive 2 cents, and so
on. The donations 1, 2, 4, ... form a geometric sequence. Calculate (Give your answer to
the nearest Rand)
A The amount of money that the school will receive for the correct answer to the 20th
question.
B The total amount of money that the school will receive if all 20 questions are answered
correctly.
17. The first term of a geometric sequence is 9, and the ratio of the sum of the first eight terms
to the sum of the first four terms is 97 : 81. Find the first three terms of the sequence, if
it is given that all the terms are positive.
18. (k − 4); (k + 1); m; 5k is a set of numbers, the first three of which form an arithmetic
sequence, and the last three a geometric sequence. Find k and m if both are positive.
473
36.10 CHAPTER 36. SEQUENCES AND SERIES - GRADE 12
A Determine p.
C Determine the 10th term of this sequence correct to one decimal place.
20. The second and fourth terms of a convergent geometric series are 36 and 16, respectively.
Find the sum to infinity of this series, if all its terms are positive.
P5 k(k + 1)
21. Evaluate:
k=2 2
22. Sn = 4n2 + 1 represents the sum of the first n terms of a particular series. Find the second
term.
∞ 12
27pk =
P P
23. Find p if: (24 − 3t)
k=1 t=1
102001 + 102003
102002 + 102002
∞
(x + 2)p , if it exists, when
P
26. Determine
p=1
5
A x=−
2
B x = −5
∞
P
27. Calculate: 5 · 4−i
i=1
28. The sum of the first p terms of a sequence is p (p + 1). Find the 10th term.
D E
C D E
B C D E
A B C D E
B C D E
C D E
D E
A If the pattern continues, find the number of letters in the column containing M’s.
B If the total number of letters in the pattern is 361, which letter will the last column
consist of.
∞
(x + 2)p , if it exists, when
P
33. Determine
p=1
5
A x=−
2
B x = −5
∞
P
34. Calculate: 5 · 4−i
i=1
475
36.10 CHAPTER 36. SEQUENCES AND SERIES - GRADE 12
35. The sum of the first p terms of a sequence is p (p + 1). Find the 10th term.
36. The powers of 2 are removed from the set of positive integers
476
Appendix A
PREAMBLE
The purpose of this License is to make a manual, textbook, or other functional and useful doc-
ument “free” in the sense of freedom: to assure everyone the effective freedom to copy and
redistribute it, with or without modifying it, either commercially or non-commercially. Secondar-
ily, this License preserves for the author and publisher a way to get credit for their work, while
not being considered responsible for modifications made by others.
This License is a kind of “copyleft”, which means that derivative works of the document must
themselves be free in the same sense. It complements the GNU General Public License, which
is a copyleft license designed for free software.
We have designed this License in order to use it for manuals for free software, because free
software needs free documentation: a free program should come with manuals providing the
same freedoms that the software does. But this License is not limited to software manuals; it
can be used for any textual work, regardless of subject matter or whether it is published as a
printed book. We recommend this License principally for works whose purpose is instruction or
reference.
The “Invariant Sections” are certain Secondary Sections whose titles are designated, as being
those of Invariant Sections, in the notice that says that the Document is released under this
License. If a section does not fit the above definition of Secondary then it is not allowed to be
designated as Invariant. The Document may contain zero Invariant Sections. If the Document
does not identify any Invariant Sections then there are none.
The “Cover Texts” are certain short passages of text that are listed, as Front-Cover Texts or
Back-Cover Texts, in the notice that says that the Document is released under this License. A
Front-Cover Text may be at most 5 words, and a Back-Cover Text may be at most 25 words.
A “Transparent” copy of the Document means a machine-readable copy, represented in a format
whose specification is available to the general public, that is suitable for revising the document
straightforwardly with generic text editors or (for images composed of pixels) generic paint
programs or (for drawings) some widely available drawing editor, and that is suitable for input
to text formatters or for automatic translation to a variety of formats suitable for input to text
formatters. A copy made in an otherwise Transparent file format whose markup, or absence of
markup, has been arranged to thwart or discourage subsequent modification by readers is not
Transparent. An image format is not Transparent if used for any substantial amount of text. A
copy that is not “Transparent” is called “Opaque”.
Examples of suitable formats for Transparent copies include plain ASCII without markup, Texinfo
input format, LATEX input format, SGML or XML using a publicly available DTD and standard-
conforming simple HTML, PostScript or PDF designed for human modification. Examples of
transparent image formats include PNG, XCF and JPG. Opaque formats include proprietary
formats that can be read and edited only by proprietary word processors, SGML or XML for
which the DTD and/or processing tools are not generally available, and the machine-generated
HTML, PostScript or PDF produced by some word processors for output purposes only.
The “Title Page” means, for a printed book, the title page itself, plus such following pages as
are needed to hold, legibly, the material this License requires to appear in the title page. For
works in formats which do not have any title page as such, “Title Page” means the text near the
most prominent appearance of the work’s title, preceding the beginning of the body of the text.
A section “Entitled XYZ” means a named subunit of the Document whose title either is precisely
XYZ or contains XYZ in parentheses following text that translates XYZ in another language.
(Here XYZ stands for a specific section name mentioned below, such as “Acknowledgements”,
“Dedications”, “Endorsements”, or “History”.) To “Preserve the Title” of such a section when
you modify the Document means that it remains a section “Entitled XYZ” according to this
definition.
The Document may include Warranty Disclaimers next to the notice which states that this
License applies to the Document. These Warranty Disclaimers are considered to be included by
reference in this License, but only as regards disclaiming warranties: any other implication that
these Warranty Disclaimers may have is void and has no effect on the meaning of this License.
VERBATIM COPYING
You may copy and distribute the Document in any medium, either commercially or non-commercially,
provided that this License, the copyright notices, and the license notice saying this License applies
to the Document are reproduced in all copies, and that you add no other conditions whatsoever
to those of this License. You may not use technical measures to obstruct or control the reading
or further copying of the copies you make or distribute. However, you may accept compensation
in exchange for copies. If you distribute a large enough number of copies you must also follow
the conditions in section A.
You may also lend copies, under the same conditions stated above, and you may publicly display
copies.
COPYING IN QUANTITY
If you publish printed copies (or copies in media that commonly have printed covers) of the
Document, numbering more than 100, and the Document’s license notice requires Cover Texts,
620
APPENDIX A. GNU FREE DOCUMENTATION LICENSE
you must enclose the copies in covers that carry, clearly and legibly, all these Cover Texts: Front-
Cover Texts on the front cover, and Back-Cover Texts on the back cover. Both covers must also
clearly and legibly identify you as the publisher of these copies. The front cover must present the
full title with all words of the title equally prominent and visible. You may add other material on
the covers in addition. Copying with changes limited to the covers, as long as they preserve the
title of the Document and satisfy these conditions, can be treated as verbatim copying in other
respects.
If the required texts for either cover are too voluminous to fit legibly, you should put the first
ones listed (as many as fit reasonably) on the actual cover, and continue the rest onto adjacent
pages.
If you publish or distribute Opaque copies of the Document numbering more than 100, you must
either include a machine-readable Transparent copy along with each Opaque copy, or state in or
with each Opaque copy a computer-network location from which the general network-using public
has access to download using public-standard network protocols a complete Transparent copy of
the Document, free of added material. If you use the latter option, you must take reasonably
prudent steps, when you begin distribution of Opaque copies in quantity, to ensure that this
Transparent copy will remain thus accessible at the stated location until at least one year after
the last time you distribute an Opaque copy (directly or through your agents or retailers) of that
edition to the public.
It is requested, but not required, that you contact the authors of the Document well before
redistributing any large number of copies, to give them a chance to provide you with an updated
version of the Document.
MODIFICATIONS
You may copy and distribute a Modified Version of the Document under the conditions of
sections A and A above, provided that you release the Modified Version under precisely this
License, with the Modified Version filling the role of the Document, thus licensing distribution
and modification of the Modified Version to whoever possesses a copy of it. In addition, you
must do these things in the Modified Version:
1. Use in the Title Page (and on the covers, if any) a title distinct from that of the Document,
and from those of previous versions (which should, if there were any, be listed in the History
section of the Document). You may use the same title as a previous version if the original
publisher of that version gives permission.
2. List on the Title Page, as authors, one or more persons or entities responsible for authorship
of the modifications in the Modified Version, together with at least five of the principal
authors of the Document (all of its principal authors, if it has fewer than five), unless they
release you from this requirement.
3. State on the Title page the name of the publisher of the Modified Version, as the publisher.
4. Preserve all the copyright notices of the Document.
5. Add an appropriate copyright notice for your modifications adjacent to the other copyright
notices.
6. Include, immediately after the copyright notices, a license notice giving the public permis-
sion to use the Modified Version under the terms of this License, in the form shown in the
Addendum below.
7. Preserve in that license notice the full lists of Invariant Sections and required Cover Texts
given in the Document’s license notice.
8. Include an unaltered copy of this License.
9. Preserve the section Entitled “History”, Preserve its Title, and add to it an item stating
at least the title, year, new authors, and publisher of the Modified Version as given on the
Title Page. If there is no section Entitled “History” in the Document, create one stating
the title, year, authors, and publisher of the Document as given on its Title Page, then
add an item describing the Modified Version as stated in the previous sentence.
621
APPENDIX A. GNU FREE DOCUMENTATION LICENSE
10. Preserve the network location, if any, given in the Document for public access to a Trans-
parent copy of the Document, and likewise the network locations given in the Document
for previous versions it was based on. These may be placed in the “History” section. You
may omit a network location for a work that was published at least four years before the
Document itself, or if the original publisher of the version it refers to gives permission.
11. For any section Entitled “Acknowledgements” or “Dedications”, Preserve the Title of the
section, and preserve in the section all the substance and tone of each of the contributor
acknowledgements and/or dedications given therein.
12. Preserve all the Invariant Sections of the Document, unaltered in their text and in their
titles. Section numbers or the equivalent are not considered part of the section titles.
13. Delete any section Entitled “Endorsements”. Such a section may not be included in the
Modified Version.
14. Do not re-title any existing section to be Entitled “Endorsements” or to conflict in title
with any Invariant Section.
If the Modified Version includes new front-matter sections or appendices that qualify as Secondary
Sections and contain no material copied from the Document, you may at your option designate
some or all of these sections as invariant. To do this, add their titles to the list of Invariant
Sections in the Modified Version’s license notice. These titles must be distinct from any other
section titles.
You may add a section Entitled “Endorsements”, provided it contains nothing but endorsements
of your Modified Version by various parties–for example, statements of peer review or that the
text has been approved by an organisation as the authoritative definition of a standard.
You may add a passage of up to five words as a Front-Cover Text, and a passage of up to 25
words as a Back-Cover Text, to the end of the list of Cover Texts in the Modified Version. Only
one passage of Front-Cover Text and one of Back-Cover Text may be added by (or through
arrangements made by) any one entity. If the Document already includes a cover text for the
same cover, previously added by you or by arrangement made by the same entity you are acting
on behalf of, you may not add another; but you may replace the old one, on explicit permission
from the previous publisher that added the old one.
The author(s) and publisher(s) of the Document do not by this License give permission to use
their names for publicity for or to assert or imply endorsement of any Modified Version.
COMBINING DOCUMENTS
You may combine the Document with other documents released under this License, under the
terms defined in section A above for modified versions, provided that you include in the combi-
nation all of the Invariant Sections of all of the original documents, unmodified, and list them
all as Invariant Sections of your combined work in its license notice, and that you preserve all
their Warranty Disclaimers.
The combined work need only contain one copy of this License, and multiple identical Invariant
Sections may be replaced with a single copy. If there are multiple Invariant Sections with the
same name but different contents, make the title of each such section unique by adding at the
end of it, in parentheses, the name of the original author or publisher of that section if known,
or else a unique number. Make the same adjustment to the section titles in the list of Invariant
Sections in the license notice of the combined work.
In the combination, you must combine any sections Entitled “History” in the various original
documents, forming one section Entitled “History”; likewise combine any sections Entitled “Ac-
knowledgements”, and any sections Entitled “Dedications”. You must delete all sections Entitled
“Endorsements”.
622
APPENDIX A. GNU FREE DOCUMENTATION LICENSE
COLLECTIONS OF DOCUMENTS
You may make a collection consisting of the Document and other documents released under
this License, and replace the individual copies of this License in the various documents with a
single copy that is included in the collection, provided that you follow the rules of this License
for verbatim copying of each of the documents in all other respects.
You may extract a single document from such a collection, and distribute it individually under
this License, provided you insert a copy of this License into the extracted document, and follow
this License in all other respects regarding verbatim copying of that document.
TRANSLATION
Translation is considered a kind of modification, so you may distribute translations of the Doc-
ument under the terms of section A. Replacing Invariant Sections with translations requires
special permission from their copyright holders, but you may include translations of some or
all Invariant Sections in addition to the original versions of these Invariant Sections. You may
include a translation of this License, and all the license notices in the Document, and any War-
ranty Disclaimers, provided that you also include the original English version of this License and
the original versions of those notices and disclaimers. In case of a disagreement between the
translation and the original version of this License or a notice or disclaimer, the original version
will prevail.
If a section in the Document is Entitled “Acknowledgements”, “Dedications”, or “History”, the
requirement (section A) to Preserve its Title (section A) will typically require changing the actual
title.
TERMINATION
You may not copy, modify, sub-license, or distribute the Document except as expressly provided
for under this License. Any other attempt to copy, modify, sub-license or distribute the Document
is void, and will automatically terminate your rights under this License. However, parties who
have received copies, or rights, from you under this License will not have their licenses terminated
so long as such parties remain in full compliance.
Each version of the License is given a distinguishing version number. If the Document specifies
that a particular numbered version of this License “or any later version” applies to it, you have the
option of following the terms and conditions either of that specified version or of any later version
that has been published (not as a draft) by the Free Software Foundation. If the Document does
not specify a version number of this License, you may choose any version ever published (not as
a draft) by the Free Software Foundation.
If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, replace the “with...Texts.”
line with this:
with the Invariant Sections being LIST THEIR TITLES, with the Front-Cover Texts being LIST,
and with the Back-Cover Texts being LIST.
If you have Invariant Sections without Cover Texts, or some other combination of the three,
merge those two alternatives to suit the situation.
If your document contains nontrivial examples of program code, we recommend releasing these
examples in parallel under your choice of free software license, such as the GNU General Public
License, to permit their use in free software.
624