- 3.1 tExpand( expression )
- Returns an expression in which sines and cosines of integer-multiple angles, angle sums, and angle differences are expanded. Use in Radian MODE for best results.
- 3.2 tCollect( expression )
- Returns an expression in which products and integer powers of sines and cosines are converted to a linear combination of ssines and cosines of multiple angles, angle sums, and angle differences. Converts trigonometric polynomials into a linear combination of their harmonics.
- 4.1 tri( )
- A program that computes the unknown parts of a triangle. The six parts are named conventionally. We enter known values in order as if we were traveling around the perimeter of the triangle. Start with angle A which is next to side c, then angle B, side a, angle C, and finally side b.
The known parts must have the form SAS, ASA, SSS, or hS to guarantee a unique solution. The program will give a solution to any possible triangle or an error message if no solution is possible. If there are two possible solutions then the program returns both of them. If no side is known then the program assigns a length of 1 to side a and computes a triangle with relative length sides.
The solved parts of the triangle are scrolled onto the output screen three parts at a time. Their values are stored in memory under the variable names aa, ab, ac, sa, sb, sc along with the values for the triangle perimeter p, and triangle area ar.
The angles must be entered (radian or degree) according to the current MODE setting.
- 4.2 tSolve( trigEqn, var, min, max ) - by Olivier Miclo
- Returns a list of solutions, with duplicates removed, of the trigonometric equation, trigEqn, for the variable, var. The minimum, min, and maximum, max, endpoints of the domain must be specified.
- 4.3 tSimplfy( trigExpression ) - by Brett Sauerwein
- Simplifies messy trig expressions from the CAS output into simpler results involving cosecant, secant, and cotangent. Input trigExpression to be simplified.
- 4.4 GCplan( p1 , p2, ss ) - by Scott Campbell
- GCplan( p1 , p2, ss ) is a program that creates a matrix with the great circle course and distance from point p1 to point p2 from anywhere on the surface of the earth. The number of navigational legs may be controlled by specifying a step size, ss, for each leg of the route. The law of cosines from spherical trigonometry is the calculation engine. The .zip file contains complete instructions.
