H I N T The results of POLYROOT will often not be easily seen in HOME due to the number of decimal places, especially if they are complex numbers. It is better to store the results of POLYROOT to a matrix.
For example,
COMB | Number of combinations (without regard to order) of n things |
| taken r at a time: n!/(r!(n−r)). |
| COMB(n,r) |
| Example |
| COMB(5,2) returns 10. That is, there are ten different |
| ways that five things can be combined two at a time. |
! | Factorial of a positive integer. For |
| This calculates the gamma function. |
| value! |
PERM | Number of permutations (with regard to order) of n things |
| taken r at a time: n!/ |
| PERM (n,r) |
| Example |
| PERM(5,2) returns 20. That is, there are 20 different |
| permutations of five things taken two at a time. |
RANDOM | Random number (between zero and 1). Produced by a pseudo- |
| random number sequence. The algorithm used in the |
| RANDOM function uses a “seed” number to begin its |
| sequence. To ensure that two calculators must produce |
| different results for the RANDOM function, use the |
| RANDSEED function to seed different starting values before |
| using RANDOM to produce the numbers. |
| RANDOM |
Using mathematical functions |