|(Parent Dir)||folder|| ||Up to TI-86 BASIC Math Programs|
Reduces rational values with continued fraction. The program can give correct answers to fractions with a numerator and denominator of a million and more.
|amch.zip||1k||99-06-12||Amount Change in Percent|
Amount Change in Percent changing
|averinnu.zip||4k||00-01-08||Small Averaging Program|
This is a little program I made. It does averaging.
This is a very small program that will average as many numbers as you feel like entering or until you get and error memory
Add Subtract Multiply or Divide non-base-10 numbers.
CFrac1 is a small and fast program that reduces rational values. Its capacity is much better than the built in >Frac. The built in program has a largest denominator of 9999. CFrac1 can give correct answers for values of the numerator and denominator up to 40- 50 000. The answer is given both as improper fraction and as a mixed number, when the value is bigger than one. Can be used for quickly separating rational numbers from irrational, if the rational numbers don't have a too big fraction.
A nifty little common denominator finder I wrote in Math Class the other day; nothing special, pretty self explainatory.
ABILIFY: This program converts decimals to exact forms. It can convert to a multiple of a square root, a multiple of pi, a multiple of e, or to a fraction. All results are simplified. It can also do this for complex numbers. The program sifts the information in the Ans-memory, showing only what is relevant. ADVANCE: This program is identical with the one above, except that it can also handle a square root of a multiple: not just the numerator is reduced, but also the denominator. 1002 and 1115 bytes resp.
Gives an idea of how hard a number is to deal with.
Displays whether a number is even or odd.
This program shows you all the factors of an entered number.
This is the smallest and simplest factoring I know of, and it works!
Now twice as fast as before, a faster routine for verifying numbers entered, and the abiltiy to factor negative numbers.
Factorer v1.21 factors integers (finds divisors). It is a converted prime factor program, and as such extremely fast compared to the ordinary factor program wich simply counts up to the square root of the number.
|factors86.zip||1k||02-12-07||The Prime Factor|
Factors any number to primes, with decimal and negative support.
Displays a list of all factors of an entered number
Lists the prime factors of a number.
This outputs all of the integral factors of a number in list form.
Find all the factors of any number you input. This program works faster that other factor programs because once it gets to a number that is 1/2 as big as the number you input, it stops ( because no number has a factor that is greather than 1/2 of itself except for itself, which is also displayed)
|fracexpd.zip||2k||06-04-12||Fraction Expander Deluxe|
This has been updated to be extremely small, ported to all TI's, and to be supremely fast. The program prompts you for 3 numbers: A and B from A/B, and C for number of decimal places. Then you watch it perform long division so fast your eyes hurt :)
|fracint.zip||1k||98-03-24||FracINT 1.0 (front end app for newFrac)|
Simple front end application for Keith Batten s newFrac utility.
|fracsolv.zip||1k||98-09-20||Fraction Solver v1|
Converts decimals to mixed numbers
|fractionreducer.zip||1k||02-07-23||Fraction Reducer v1.0|
You put in the numerator and denominator then it reduces it.
Very small prog to give you simplified fractions like 5.25=5 1/4
|golden89.zip||22k||06-04-19||Golden Ratio (All TI's & DOS)|
Each program finds the Golden Ratio and stores it to B. The DOS version simply tells you the Golden Ratio and shows the same math as the TI versions (but MUCH faster).
A factoring program optimized for speed and size. Takes less than 4 seconds to factor 8337.
Simplifies/ add/subdtracts,etc. imaginary numbers
This program is simply a program to help you practice adding, subtracting, and multiplying integers. The program picks 2 random integers between -20 and 20 (default) and asks you to add, subtract, or multiply. You can change the 2 numbers that the program picks from by choosing "Ctrl" in the Main Menu.This is my first program. If you find any bugs (I am almost sure that there are no bugs) please e-mail me at firstname.lastname@example.org. Also please e-mail me if you see where I could improve, in code, or layout.
Raises i (sqrt -1) to the nth power.
This program lets the user view large numbers without the little E, for example 10000000000000 instead of 1E13. Read the readme and follow the instructions
|logbase.zip||1k||03-05-16||LOG base changer|
A tiny litle program which allows you to use log with bases other than 10. Just enter the base and the "x" in LOG x and your done.
This program allows you to get the log (WITH ANY BASE!) of a number.
Finds the log of x that is a non base of 10 number.
|ncalc86.zip||5k||04-04-30||NCalc 86 v1.0-3.1|
This is a pack of my redone NCalc programs. It has some new features, as well.
Percent Change between 2 inputs
|perfect.zip||1k||03-04-17||Perfect Number Finder|
Enter the number to start searching and the number to stop and it will find all the perfect numbers in that range.
The Ultimate Prime Factorizer and Radical Reducer
a neat little program to get the pgcd (higher common diviser) of two numbers. Utile pour les spé maths en Term S ! Le seul Calcul de PGCD trouvable sur le net !
|powroot.zip||6k||03-06-19||Any Root Finder (Guess-n-Check Method)|
This is simple to use. You input the number, the root you want to find (2 for square, 3 for cube, etc), and how many decimal places. It'll only show the TI's limit in decimal places, but is pretty cool nonetheless. Quickly made for every TI.
|prime200.zip||3k||04-07-11||Prime Number version 2.00|
This is the next version of PrimeNum. It is about 15 times faster than the original and does not reintroduce the nth root bug I had trouble with in test versions.
Tests your number for primality.
|prime86p.zip||1k||03-04-17||Prime Number Finder|
Enter the number to start searching and the number to stop and it will find all of the prme numbers in the range... eventually
Twice as fast as the original, and now the abiltiy to check negative numbers
Very fast primefactorprogram.
|primefact.zip||1k||00-04-11||Prime Sieve and Trinomial solver|
Two Programs that I wrote for algebra class. One give you the prime factorization of any number, and a trinomial factorization solver
|primefdr.zip||1k||03-04-13||Prime number finder|
This program asks the user for a number. Starting at that number, the calculator displays all prime numbers. NOTE: There are two problems with the program. First, it is fairly slow. Secondly, after testing for a while (~60 numbers) the calculator gives the ERROR 15 MEMORY message. If any one has tips on how to speed up the program, or get rid of the errpr message, I'll take your suggestions @ email@example.com. I dont think that these problems will occur if you run the program in an emulator.
Generates a list of prime numbers and stores it as a list. Also has a prime twin option available.
|prime.zip||1k||98-09-24||Prime Number Checker|
Checks a number to see if its prime
Very small prime factorization program
Gives the primenumbers within a given interval.
Just a short program I wrote in Math class the other day that reduces fractions given a numerator and a denominator.
|rpn.zip||1k||01-04-04||Reverse Polish Notation|
A program for those of you who believe 2 3 + 4 5 + * makes more sense than (2+3)*(4+5).
|simplify.zip||1k||03-10-19||Fraction Simplification Program|
Simplify any fraction (example: 45/20 simplifies to 9/4). Takes up only 46 bytes, 2 less than before!
|squf.zip||1k||97-12-27||Shank's Square Form Factoring Algorithm|
Solves the value of specific triangular numbers. Transferred from my previous TI-81 Version.
Solves for large powers. Copied from my previous TI-81 Version.
This program displays all factors of any number you input.