Program Zero: Trigonometry

This is my first program. It prompts you for an angle in degree mode, then graphs it and gives you sin x, cos x, and tan x. Other trigonometric functions such as sec x or cot x could be added easily by copying the corresponding line and changing the value calculated to its reciprocal. Make sure you are in DEG mode or you could get some strange results.

Program One: Etch-A-Sketch Simulator

Electronic doodling in class. The TI calculators have a built in feature similar to this, but for those of you with Casio's, this should be a lot of fun during boring lectures.

This gives you the opportunity to resume a drawing you left off on (or to draw over a graph you just made, because it doesn't reset any range). It has both a plot (pencil) and line tool.

Program Two: Interest

This is a sort of financial program that I wrote for FST. You may or may not find it ueseful. It is based on accounts compounded monthly.

Program Three: Function Value Table

This program takes a function f(x) in it and prompting for a start, end, and interval, calculates the values of f(x) for points along that interval. It is especially useful for locating zeros, and is based on a basic program in the FST book.

Program Four: The Quadratic Formula

This is a very simple program that takes values for A, B, and C and plugs them into the quadratic formula to give you the two roots. Believe me, you'll use it more than you think.

Program Five: Probability #1

This program is designed to give you the probability of getting k successes in n trials if the probability of success for each trial is p. It will let you check several values for the same p and n without restarting the program.

Program Six: Probability #2

Similar to Probability #1, but it lets you take a sum of a range of successes (for example, a fair coin toss, probability of getting one, two, or three heads).

Program Seven: Probability #3

Calculates the mean, variance, and standard deviation for a set of n trials with a probability of success p.

Program Eight: The Factors of a Number

This should be pretty self explanatory. You enter a number and it tells you all factors and the total number of factors (if odd, then the number is a perfect square).

Program Nine: Probability Distribution Graphs

This program works in a similar manner to Probability #1, but it displays results for each possible number of successes in a bar graph which you can then trace with the trace key. Very nice. SD MODE

Program A: Estimating the Area of an Inequality

This is also based on an FST basic program. You will have to supply the function and adjust the randomization accordingly, as follows:

For the Ran# sent to X or Y, for a domain between -a and a, use (2aRan#-a), and for a domain between 0 and a, use aRan#. Other ranges can be specified with a bit of paperwork, but those two are the most common and are used in this example.

Program B: Guess the Number Game

The classic game where you try to guess a number and the "host" tells you if the correct answer is higher or lower. This keeps track of your stats over many games until you exit.

Program C: Standard Bell Curve Probability

Enter two values, and this program calculates the exact probability of a number falling in that range. Another simple timesaver. SD MODE

NOTE: The R( comes from the PQR submenu.

Program D: TC-Windows

An icon interface for programs. There are several calls for other programs in this one, so make sure that they correspond with the right program on yours as they do in this page.

Program E: Binomial Expansion

Inputs the coefficiants for each term and the power to take the binomial to, then gives the coefficients of the expanded polynomial.

Program G: Average of a Sample

This randomly selects s numbers from 0 to 9 and averages them, then starts over with a new set. It was more of an experiment than anything. Notice how as you increase the size, the numbers are staying closer to the "limit" of 4.5. It also stores the average of all averages in memory spot A in case you would like to see that as well.

Program I: Roots of Negatives

This program is somewhat untested fully, but it is in this slot to replace an old program I had written to help me practice for a rescue breathing demonstration in my health class (asked age of person, then gave the command breathe at regular intervals). Anyway, this will supposively find the rth roots of a negative number.

Program J: Mandelbrot Fractal

After asking for the maximum iterations and a range, this program graphs an image of the Mandelbrot set in the complex plane. This takes a very long time to do because the calculator uses floating point math and is slow to begin with.

Program K: Julia Sets

Similar to the above program, but will graph a Julia set for any point in the complex plane based on the Mandelbrot algorithm.

Programs M, H, and L: Truth Tables for the Casio

This program takes advantage of the base-2 logical operations (submenu LOG under BASE-N MODE) to generate truth tables for statements p with q but also p with q with r. You must enter the logical expression into the program itself.

Prog M: BASE-N MODE

Prog H: COMP MODE

Prog L: COMP MODE

Program N: Modular Arithmetic

From the PCDM course, this program makes it easier to check modular arithmetic for large numbers or sentences. Enter the mod and the number or sentence to evaluate. It handles negatives correctly as well.

Program O: Prime Number Program

For use at all levels of instruction. This goes hand in hand with the factor program, and could be interfaced if you'd like by replacing the "NOT PRIME" remark with a program call to the factor program. If you do this, however, you must make sure that n somehow ends up as the variable coming into the factor program. Because the program as written uses n anyway, all you would really have to do is remove the first prompt in the factor program. You can view the list of primes starting at any point or test a number to see if it is prime.

Program P: Polynomial Division

This will divide any polynomial of degree up to 8 by any of degree up to 7, giving all coefficients of the quotient and of the remainder. This has been tested without error so far. Again, it is a good checking technique.

All *.cas files are now zipped and accessible directly through this page.