|(Parent Dir)||folder|| ||Up to TI-83 BASIC Math Programs|
|abigsiv.zip||2k||99-02-25||Prime Factoring Program|
Finds prime factors of a number
Reduces rational values with continued fraction. The program can give correct answers to fractions with a numerator and denominator of a million and more.
|aprime.zip||2k||11-04-09||Three Prime Checkers|
APRIME: This is the simplest prime checker possible. It has only 78 bytes, and it tells you wether the number is prime or composite. If composite it gives you the smallest prime factor. It has good speed for its size: It tells you that 333667 is a prime in just 6 seconds! APRIME1: This is the second fastest prime checker that I have made. It has only 124 bytes, and it takes just a little more than two seconds to tell you that 333667 is a prime! APRIME2: This is the fastest prime checker. It uses a list ( LP ), that you need to install, either directly or by running PRCINST, before you can use the program. 10566779 is confirmed as a prime in just 8 seconds!
Averages any number of numbers that you give it.
Program that does any root (square, cube, etc), factorials, and absolute value.
BIGXPONT is a TI-basic program that allows to calculate an approximate version of the result of a power, even if it exceeds the normal limitation of 9.9999999999*10^99, it can even go higher than 9.9999999999*10^(10^90). And the same goes for extremely low values.
|bignum.zip||3k||02-02-10||Large Number Calculator|
Addition, subtraction, multiplication, division, and exponentiation with numbers of any length!
|binadsub.zip||1k||01-05-31||Binary Addition and Subtraction|
Take two decimal number converts to binary and then adds or subtracts them and gives the result in decimal and binary
Highly optimized program will factor a number that you input. Amazing speed for BASIC!
|csfactor.zip||1k||97-09-16||Prime Factor Program 3.61|
Finds the prime factors of a number. Has some neat features that TI's sample doesn't have.
This program simply calculates the value of e (approx. 2.718) by using a very very long loop. You can start the calculation from any point less than 1x10^9 and you can increment by any value you like.
Finds integer factors of positive integers
Prime factorization of positive integers.
This is the smallest factoring program available.
Displays all factors of a number that are also square 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.
|factorial2.zip||2k||00-05-26||Factorial Plus v2.0|
If you use your TI-83 to calculate 70!, you will get an error message. This program overcomes this limitation. This update is much faster than the original version.
Calculates factorials between 70-449 using a modified Stirling's formula. For numbers 450 and over uses Stirling's formula. For example the factorial of 100 is 9.33262154e157. The factorial of 450 is 1.7333687e1000. The factorial of 1000000 is 8.2639e5565708. Very fast.
This program computes the prime factorization of a given number. It performs this computation pretty fast. This is a similar version of my 83+ Factors program. However, since the 83 does not support lower case letters, this version was necessary.
This is a handy math program that is pretty useful. It does 7 things. It will find all the factors of a number, find the prime factors of a number, solve for the quadratic equation, solve for the cubic equation, simplify any radical to any root or index, find the remainder in a division problem, and tell you what factorial a number is if it is one.check out the screeshots.
Gives all the factors of the given number.
|factorzip.zip||1k||03-08-22||FAST FACTOR PROGRAM! A MUST HAVE!|
This is a program I designed in 7th grade and I've been slowly modifying it making it faster and faster. Now it does 10000 in about 5 seconds and includes a Percent done, the Sqr root of the number and the current loop number.
|factrial.zip||1k||98-02-24||Factorial Solver (AShell83 Compatible)|
If you use your TI-83 to calculate 70!, you will get an error message. This program overcomes this limitation.
This file contains two programs and a textfile: 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 and it can't handle a fraction like 8620/4311. 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. Frac1 is a program aimed for bigger fractions where you input one term at a time. The numbers can have a numerator and denominator of ten digits.
|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 :)
|fraction.zip||2k||02-02-20||Rational Number Functions|
Includes rational approximation of real numbers, decomposition into unit fractions, arbitrary precision decimal representaion of fractions, and continued fraction expansion
Lets you +, -, *, and / by entering mixed numbers and getting your answer as a mixed number. Also lets you evaluate any expression and get the result as a mixed number.
Calculates the gcd of a list.
|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).
Computes the golden ratio. Just enter a number between 3 and 480 for the precision. It converges very fast. At 25 the precision is greater than the calculator's! Check your answer with the other formula (1+ sqrt 5 ) / 2. It might also be fun to look at list 1 after running the program to try to figure out how it increments.
|isxprime2.0.zip||5k||11-03-10||IS X PRIME 2.0 (FIXED)|
After months of research and modifying, I have finally created the fastest prime checker ever! It is 18% faster than any program I have checked! Includes two programs, one is just the basic checker (fastest), and the other is the same with lots of more features! I conducted an experiment that you can see in the README.TXT file. Includes older versions of these programs.
This is a small yet powerful program that will find the lowest common multiple of any numbers, and can work on two through infinity numbers. It will automatically and quickly find the LCM in rational form. Useful!
This program will ask for an integer. It will then test and see if there are any solutions in which, both the base, and the power are integers. If not, it will display no integer value. If there is a solution, it will tell you the base to the power.
Divides two numbers and displays 111 decimal places.
Shows the mixed number form of fractions and decimals.
Modulo division and inverses
A program that performs modular divsion
Calculate N mod M where N and M can be numbers or lists
It calculates the remaining portion of the division of x for y. x mod y=r
|multdivd.zip||1k||99-02-25||Multiply & Divide Huge Numbers|
Multiplies divides huge numbers
Many functions for integers, including: Prime factoring, list of divisors, sum of divisors, and more; solution to simultaneous modular equations; modular reduction; and list of primes between two bounds
Calculates how much you have to pay with a percent off discount. Just enter the price and the percent off.
Great program for finding out what grade you got on a test or quiz
The Ultimate Prime Factorizer and Radical Reducer
|prime2k.zip||1k||00-09-05||Prime Number v2000|
Search for a given number of primenumbers from a given point.
Very fast program that determines if a number is prime and gives a factor if it is not.
|prime3.zip||1k||00-09-22||Prime Tester v1.10|
This program tests to see if a number is prime or not.
Search is a given number is a primenumber or not!
Very fast primefactorprogram.
|primef.zip||1k||98-07-28||Prime Factors v1.3|
Lists all the prime factors of a number.
With this program you can search primes and you can calculate if a number is prime. It works really really fast. I've fixed all bugs of previous versions, twice as fast as v. 1.0 (like "error domain" while searching primes).
|primenum.zip||1k||97-09-16||Find Prime Numbers 1.0|
Calculates all the prime numbers from 1 to a number you specify.
|primer.zip||1k||02-02-16||Primer (Primes Finder)|
a program that finds all the primes between 1 and any number (maximum of 999). also displays percentage completed.
This program finds the prime factors of a number.
Determines if a number is prime.
The smallest and the fastest program that calculates primenumbers.
Finds the remainder of A/B. It will give you the divided integer and the left over remainder.
Finds integer solution of division of two numbers and gives the integer remainder.
This is just a scientific notation program, that is all I could say about it.
This program will frac any number! Very handy for large fractions that your calc won't convert.
Decimal Simplifier is a program that simplifies decimals stored in the answer memory. For instance, sin(pi/4) = .7071067812 will simplify to the sqrt(2)/2. If you arrive at the decimal equivalents for any of the following, they will simplify: pi/3, -4e, 9*sqrt(5)/2, sqrt(6)-2i, pi*sqrt(511232), 5e*sqrt(439), pi+501/12, e+1/235, 80137/13812, -5/(2pi), 3pi^2, 5e^2, 7pi^2*sqrt(3), 8e^2*sqrt(2052338). These are just a few examples. Generally, Decimal Simplifier will act as a radical simplifier and simplify any fraction multiplied by 'pi' or 'e.'
Just enter any old number, and the program will search for all the prime numbers between 1 and the number you requested. Then, it will display them all for you. The only drawback is the bigger the number, the longer it takes.