|
| |
GP:Tn, Sn,
Sinf
| When you run the program the highlight
will initially be on the ‘Define Seq.’ option, since that is the first
thing that must be done. |
 |
| You then have a choice of supplying
either a and r or the first two terms of an GP. |
|
 |
| You can then use the menu to find the
nth term, the sum to n terms or the sum to infinity (if it exists). |
|
 |
| The third option is to give
a ‘List of terms’. This will create a matrix with columns containing
Tn and Sn. The matrix will be deleted after being displayed to save
memory. Matrix M0 will be overwritten by this. For large values of n, this
can take a minute or so to complete. |
 |
 |
GP: Separate Tn
| Given two separated terms (ie T6=8192000
and T12=2147483.648) this will find the values of a and r
defining the GP. |
|
 |
|
|
y=a*b^x (2 pts)
| Given two points in (x,y) form, this
program will find the equation of the GP in the form y=a*bx.
The rate of increase is also given as a percentage
for use in financial or population growth problems. |
|
 |
 |
|
|
