|(Parent Dir)||folder|| ||Up to TI-83/84 Plus BASIC Math Programs|
|factoring||folder|| ||TI-83/84 Plus BASIC Math Programs (Factoring, Primes)|
Gives you five addition problems. You have to answer them and it will tell you if it is right or not. If it is, it goes on to the next question. If it isn't, you have to try again. Keeps score and tells you how many you got right and wrong at the end.
This Program will allow you to do things on your calculator that you only dreamed where possible (Title explans function)
Reduces rational values with continued fraction. The program can give correct answers to fractions with a numerator and denominator of a million and more.
|amodb.zip||2k||06-05-18||a mod b|
This program will give the result of a mod b. Also works properly if a is negative. A small but useful program.
A very, very simple program that allows you to solve for a logorithm with any base. Once again, very simple.
|apctsyndiv.zip||52k||07-12-17||APCT - Synthetic Division|
This program gives you the ability to use synthetic division for the 3rd power, 4th power, and 5th power.
|apercent.8xp||1k||03-04-13||All Percent Calculator|
This program find percent increase, decrease, tax, and percent of change. Since the ti-83 plus doesn't have a percent button this is a great program.
This program calculates the decimal equivalent of the ratio of two integers to a nearly infinite degree. (How far it can go will depend on how much RAM is free).
|aprop.zip||1k||03-03-07||Improper to Proper Fraction Converter|
This program quickly converts the Ans variable to a proper-fraction/mixed-number, if possible.
this program avarages a list of numbers!
Best average program ever. Only 90 bites on calc. and contains only 18 lines of basic and is EXTREMELY fast
|average2.zip||1k||03-12-28||Average It! S.E|
The second edition of Average It!. It's more than half the size of Average It!, but it does the same exact thing-finds the average of a set of numbers. The only difference about this one and the original Average It! is that you need to enclose the numbers in brackets and separate them with commas. See screenshots for a clearer explanation.
Average It! is a program that finds that average of any set of numbers. I use it mainly to figure out my GPA, but you can use it for math class or anything you want. Simply enter in the numbers and press "X", without the quotations, when your done. It is very simple, small, and has less than 50 lines of code!
A simple averaging program written in basic for TI 83/4 +/SE (tested on 83+ and 84+ se). Supports weighted grades. Allows infinite number of grades (RAM supporting) and infinite weight (same deal)
Cane make an average from 1, 2, 3, 4, and 5 numbers. Is only a demo of what is to come.
This is a basic averaging program that averages multiple numbers, not a fixed one. For more info, see the readme.
This Program Includes 10 Axioms (Closure, Commutativity, Associativity, Distributive, Identity Elements, Inverses, Reflexive, Symmetry, Transitive, Trichotomy) With a short description to help you remember. Brought to you by Tiger_377
Add, subtract, multiply, or divide non-base-10 numbers
This simple math program uses the gcd() function to find the least common denominator in a fraction.
|basicrpn.zip||1k||09-02-09||RPN calculator 1.0|
Basically transforms your calc into a simple RPN system.
This program can multiply numbers of infinite length and gives an exact answer.
Big-Number Multiplication allows you to multiply far bigger numbers than the TI calculator supports. It's very easy to use and displays the answer in a convenient way. This program is faster, takes up less memory, and is easier to use than all other BASIC programs like it. It can multiply two numbers that both take up the entire screen in less than a minute. The program is unprotected and is so simple to use that I didn't bother to include a ReadMe.
|binadir4bit_adder.zip||3k||07-06-06||Binadir 4-bit binary number adder|
This program adds two binary numbers together that can be up to 4-bits in length. please enjoy!
|dd1.zip||1k||09-03-24||Mega Division on Your TI Calc|
This is a fun program. The program performs long division on any two numbers and counts the number of decimal places. The TI calculator is very fast at long division!
|decsimp.zip||3k||09-07-27||Four Decimal Simplifiers|
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. ADAPT: This program presents the result of a square root like ABILIFY if the answer will then take up the same space or less, else the result is presented like ADVANCE. Otherwise the program is identical with ADVANCE. ADECSMP: This program presents the result of a square root in both ways if the denominator within the root is bigger than one. Other than that it is identical with ADVANCE. The programs are 639, 710, 776 resp. 743 bytes on your calculator.
|double.zip||1k||03-12-28||Double the Number|
This program starts by displaying 1, then it adds 1, and displays 2. It then adds 2, and displays 4. Keep pressing enter to see the next doubled number. Press [CLEAR] to quit the program. See screenshots.
|dpg.zip||1k||03-05-04||Digit Problems Generator|
A Jamaica Bay Classroom Tool- helps students learn subsitution. Easy to use, good user interface.
|drexp.zip||12k||09-04-05||Exponent Digital Root v2|
Finds the digital root of a number to power. See readme for details, especially regarding the included word document.
Creates Euclidean Algorithm in the stat editdor.
Gives an idea of how hard a number is to deal with.
|eulerphi.zip||1k||03-04-01||Euler Phi Function|
This simple program will quickly count the number of relatively prime numbers to a given number N.
|factorfast.zip||1k||10-06-14||Factor FAST v 2.3.5|
As you noticed, there's special emphasis on the FAST. Although it doesn't seem too great at first, the best thing about this program is that once it finds half of the factors, it automatically calculates the second half in a matter of milliseconds. I belive this is one of the only programs that can factor a million in under 45 seconds. If you forget what the factors are, just check the list FACTR, and it'll show you all of them! This will be a great addition to your calculator.
This is one of the many programs I wrote in the middle of my Math 12 Summer School class. If you input a number, it would calculate the... uh.. well, if you put in "5", it would calculate "5!" which equals to "5x4x3x2x1" (It was supposed to help me with my math... it didn't really because I ended up having no use for it.. but still...)
|factors.zip||1k||09-10-20||Find all Factors|
enter an integer and have all the factors returned in an ascending order to L1
You name the number, it factorialized it. EX- "5" it outputs 120 (5x4x3x2x1)
|fctrlm1.zip||1k||08-11-30||FACTORIAL MINUS 1|
Do you know if 720 is a factorial?? Of which integer? And 40320? I know thanks to this program! 720=6! and 40320=8! This is just the inverse function of factorial, have fun!
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.
FracCalc is the best fraction calculator "patch" that I have been able to find or create on ticalc.org. It is a program that allows you to input expressions using fractions and will return the answer in both fraction and decimal form. This program has been created and tested on a TI-84+ SE only, if you have a different calculator and this program works (or if it doesnt!) please send me an e-mail.
|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 :)
|fraction2.zip||15k||01-01-14||Fraction Calculator Add-On: Ti-83+|
This program does basically what it says it does, have at the toch of a button decimal to fraction, fraction to decimal, and a fraction simplifier or converter. No more menus! You can add or subtract. Multiply or Divide, heck I bet you could do logarithms, I haven't tried yet. Partly because I'm not that far in algebra 2 yet, but... And best of all, its small, and MirageOs compatable so it can be run archived! This is the best fraction program that I've ever seen, plus it includes a preview of "Phantasy Star V" for the Ti-83+ calculator, check it out.
Is a small and ferociously fast(20/40 digits/sec.) program that performs long division over the whole screen with the Output(-command. This update cuts 33% off of the time for the previous version.
This program concists of three parts: common and continued fraction, plus approximation of real numbers. It is meant to help in school with various types of fractions. I would be grateful for any comments, suggestions etc.
Converts and Simpilfies Fractions small too!
|gcdlcm2.zip||2k||09-10-11||GCD and LCM for Rational Numbers|
GDCLCM: This program calculates the GCD and LCM for two rational numbers. So the program can even handle fractions, and i.e: Numbers that are smaller than one! It is necessary as a subroutene in a program that factors quadratic equations with rational coefficients, for example. I use it in QUADRA12. It doesn't matter in wich order the numbers are entered, nor does it matter if they are positive or negative. GDCLCM1: This program calculates the GCD and LCM for several rational numbers. Just input the numbers as a list. Other than that it works the same way as the above program.
|gcdlcm.zip||1k||03-09-19||GCD and LCM Finder|
this will find the GCD and LCM of more than 2 numbers
|gcd.zip||1k||08-04-14||GCD (for Lists)|
GCD for Lists will take L1 and simplify it by dividing it by the greatest common divisor for all elements in that list.
Used to FIND GFC of 2 #'s
|gcflcm.zip||1k||01-01-28||GCF and LCM Finder|
This program will find the LCM or GCF of any two given numbers.
These programs finds two primes that add up to a given even number from four and upwards according to the Goldbach Conjecture. There are seven programs in the file, one with two subroutenes. They are very small, ranging from around 150- 200 bytes to 444 bytes at the most. They vary in speed in proportion to their size. You should be able to find a compromise that suits you!
This is an updated version of my previous Goldbach conjecture. This program finds a pair of prime numbers that add up to a given even number greater than 4. Every even number ever checked has been the sum of at least two primes, but nobody has been able to prove that it is always true. Presently, there is a $1 million reward for discovering the proof.
|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).
Calculates the exact value of the Golden Ratio using the quadratic formula, no need for recursive programming!
This program finds the Golden Ratio and stores it in Theta. It uses the quadratic formula, so the value is as close to exact as possible. You also get an informative screen with the relation as well as the exact value. Look at the screenshot.
|imagic.zip||1k||09-12-07||Imaginary Number Simplifier|
This is a very small ( 45 bytes ) program to help out with imaginary numbers like: i^-45, i^71, i^-3.5 and so on. Look at the screenshots.
|imagine.zip||1k||03-12-28||Imaginary Number Simplifier|
This program will take a problem like i^81 and tell you that it's actually i. Small, but useful!
|imaginry.zip||1k||04-03-17||Imaginary Number Simplifier|
This little program converts those annoying imaginary numbers with exponents to it's true form. For example it converts i^69 to it's simplest term of i.
|isprime.zip||1k||09-10-20||Is it Prime?|
enter an integer greater than 1, and see if it's prime or not
Is that pesky, unfactorable number prime? Find out with Jamaica Bay's Prime Tester. Fast programming and easy, user-friendly interface make this the best Prime Tester.
Input a number, and then input a power you wnat to take the number too. It will give you the last few integers in the number
|lcd.zip||1k||01-05-31||LCD Finder v1.1|
This is an updated version of LCD Finder 1.0. It actually works!
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!
Used to find LCM of 2 #'s
|lcmgcd.zip||1k||09-11-07||LCM and GCD|
This program gives you the LCM and GCD for a set of numbers. There are no menus or any other fuzz, just enter the numbers as a list. Look at the screenshots.
This program finds the first number that is divisible by something starting from a certain integer and testing at a certain increment. Pictures attached.
A logarithm solver where you input two known variables and get the third unknown. The program starts in the graph window where you get the basic infomation, it then asks for the unknown variable, after wich you are promted to give the two known variables. After the calculation the variables used (A, B and X) hold their respective value.
Solves for any logarithm. loga(b)=x. Give two variables and you get the third. Really, that's it.
Divides one number by a number and displays past the normal 10 digit display. Read the README file for explanation of decimal point errors.
|longdivx.zip||1k||02-01-16||Long Division X|
Divide two numbers and see the decimal to hundreds of decimal places.
Divide two numbers and see the decimal to 200+ places.
|matmzipper.zip||1k||03-06-02||Exact Values For Extremely Large Integer Multiplication (PU|
This program allows for extremely high integer multiplication. The largest integer you can display exactally on the TI-83+ is 9999999999 of 10^10-1. The largest value you can reach period, before getting an overflow error is 10^99. This program calculated the exact value of (10^277-1)^2. Using that same formula, the overflow point for the TI-92+ is (10^308-1)^2. This program //greatly// expands the multiplicative capabilities for the calculator. However, there are a few limitations. You can only multiply integers, and you have to type them out exactally. Yes, I entered 277 9's by hand. Twice. The program is pretty small, 728 bytes. Pretty fast too, it squared a google in less than 5 minutes. When you run the program, it will ask for the two numbers, then it will begin displaying the percent multiplied as it works. Once it completely multiplies the number, it takes another moment or 2 to convert it to a displayable format. Then it displays it. If it flows off the edge, just scroll. I have big plans for this program, and using the (Un)Archive functions, I hope to expand the capacity even more. See how far you can take it, my calculator is pretty bad. Push the envelope.
Finds the least common multiple (LCM) for ANY number of integers.
|mfb.zip||1k||07-12-21||Multiples, Factors, Bases (Exponents)|
This program can calculates the (lowest) multiples, factors, and Bases(Exponents) of a certain number. Example: Multiples- Number= 9 -> 3*3 Factors- Number= 9 -> 18/2 Bases- Number= 9 -> 3^2
|mixednum.zip||1k||03-12-22||Mixed Number Maker|
It always annoyed me when I had to make mixed numbers out of huge improper fractions, so I created this. Input the numerator and denominator of an improper fraction, and it will tell you the equivalent mixed number. E-mail me @ email@example.com or AIM me @ zekecoasterfreak (if you e-mail me, please include something like "TI-Programs" in the subject line) -Feel Free To Share This Release.. Make Sure To Give Me Credit!
Raises numbers to a power in modulo arithmetic.
This simple program asks for mod M, a number P, and gives you the residue of P mod M.
Does modular arithmetic for modularly-challenged people. Is very small (exactly 100 bytes) and very fast.
Performs modular division
performs modulo using two variables
Finds the Modulus of a complex number (a+bi)
It calculates the remaining portion of the division of x for y. x mod y=r
A small program that lets you count to ANY number by ANY number! If the number you count by can't fit into the number to count up to, the program WILL tell you! Great program for math purposes!
|mtiply.zip||1k||04-06-11||multiply (shows work!)|
this is a multiplication program that shows its work for most multiplication problems!
Will find all multiples of any real positive integer within memory limitations of calculator. Can be very helpful in factoring.
Due to the amount of people that can not multiply in my school, I made this. It helps you learn to multiply.
The program computes five different numeric functions for a given number n. These include a prime factorization program, a prime checker, the number of divisors of n, the sum of the divisors of n, and the Euler Phi function. This last function determines which numbers are less than n and relatively prime to n.
It makes addition, subtraction, multiplication, and division easy for people. (Run program output)
With this program, you can easily find proportions.
|percentages.zip||1k||03-03-04||Mastermind v 1.0|
A simple program to calculate percentages for those too dumb to remember the formula, like me.
This program will help you add percentages, subtract percentages and even do sales tax calculations. It has been checked numerous times for exactness against a normal percentage calculator, and it is exact to .0001 percent proficiency
Get a number with a percent change. Such as 100 with a 15% increase would equal 115. This program eliminates percent hassle and make everything easier. My site: www.angelfire.com/electronic2/miketi
This finds percent.
a Percent Solver. inclues 8 Formulas to input. simply 2 inputs each. includes "Percent of change" or "decreace/increase with percent given, With the original/new given" and 3 other formula's for everyday questions. NOTE: when the Quantities appear in the equasion, no percents will show. they will in the answer (X) though.all #'s have a minimum of 0, and almoast all #'s have a maximum of 1000, exept for a selct few Percents (equasions 2,3,7, and 8), which have a maximum of 100. NOTE: I found a small bug, so I'm updating the file, now with pictures (inside the download. I couldn't figure out how to convert .btm to .gif, Sorry)! DOWNLOAD IT! It's good!
The first seven perfect numbers are: 6, 28, 496, 8128, 33550336, 8589869056, and 137438691328. There are presently 47 known such numbers, wich are defined by the fact that the sum of their divisors is twice the number itself. For example 6 has the divisors: 1, 2, 3, 6, wich adds up to 12. There is for now no known odd number that is perfect. But it has been proven that it has to be bigger than 10^300, if it exists. All even perfect numbers are on the form: 2^(p-1)(2^p-1), where p and 2^p-1 are prime numbers. I have made four small programs to demonstrate these numbers.
I am really, really sorry about this. When I uploaded the file, I thought that it would work indefinitally. But then as I thought about it more, I realized that I made a error. The formula doesn't work for squential numbers, but rather only a few. The equation "(2^(X))* ((2^(X+1))-1)" is true for all currently known perfect numbers, but the value if "X" is speratic. So, I am uploading a progam in a while, probably about 2 hours that will fix the problem, and be available for download in about 2-3 days. Thank you again.
|pgcd.zip||1k||07-01-07||GCD / PGCD with euclidian algorithm|
This program calculates the greatest common divisor of two integers, and it displays every single step of the euclidian algorithm used.
Calculates powers with respect to a modulus, i.e. a^b (mod n) using the fast exponentiation algoritm.
This program computes expresions of the form a^b (mod m). It is extremely fast and occupies a mere 209 bytes. The values (a) and (b) can be anywhere form 1 to 1e13 and (m) can be from 1 to 2.5e12!
|prcnt.zip||1k||04-02-16||Percent of change|
This is a program i made because i was bored in math class. It shows you the percent of change by using the old number and new number and doing the rest for you even though it is easy already. it also tells wheter the chang is increased or decreased.
This program will find the prime factors of any number (even negative, if you want). The program itself is quite small, only 172 bytes. Hopefully this will help your math homework go faster!
|primeprogram.zip||4k||08-12-19||Calculate the primes from 2 to 11,967|
This program will use the Sieve of Eratosthenes.
PROP is a program that helps you solve and check proportions. Enter X for the unknown or enter both sides of the proportion to check. Check out the screenshots!
Solves proportions or check proportions! Just enter X for the unknown value to solve, or enter both sides of the proportion to check.
|prop.zip||1k||03-11-07||proportion solver fixed|
darn bad start to contributing it was messed up but only slightly i switched around labels so any way this is it fixed i hope
Converts a fraction into a decimal. This program was made by me so long ago, but I dug it out of some backup file; my 8451C 5KI115 (BASIC SKILLS) were pretty lousy, but I optimized what I could in about 30 secs.
This is a fairly simple program that makes it easy to work with, simplify, and expand simple ratios and proportions.
Update 2/27/04 -Made it so the program only displays the missing value, rather than the entire equation. Saves 200 bytes of program space and makes it much easier for the user. -----End Update----- Insert two equivalent fractions, using a 0 to note an unknown. The program will then find the unknown. E-mail Me at firstname.lastname@example.org or AIM me @ zekecoasterfreak (if you e-mail me, please include something like "TI-Programs" in the subject line) -Feel Free To Share This Release .. Make Sure I Receive Credit!-
Reduce will, as the name suggests, reduce any square root. It is very simple to use, and this version is a bit faster than version 2.3.
|remainderfinder.zip||1k||03-12-24||Remainder (Modulus) Finder|
An update from my previous Remainder (Modulus) Finder. This one is much smaller, finds the remainder of a division problem, and finds the integer part of the answer to a division problem.
You input a fraction, and it tells you the quotient and the remainder. Useful for earlier math classes, but can be used with any!
Insert the dividend and divisor and the answer + remainder is given (rather than the a decimal answer). E-mail Me at email@example.com or AIM me @ zekecoasterfreak (if you e-mail me, please include something like "TI-Programs" in the subject line) -Feel Free To Share This Release .. Make Sure I Receive Credit!-
|remaind.zip||1k||99-11-29||Remainder Division v2.1|
A program to execute remainder division onpositive integers.
|remains.zip||1k||07-01-27||A Remainder |
A small and simple program that gives you the integer part and the remainder of A/B, where A and B are real integers.
Finds the remainder when you divide two (real integers) numbers. A/B: you have to enter A and B and it will show you the integer that came out to the answer and the remainder that was left over.
[EN]Calculate the remainder in the division of a^n by B according to N. [FR]Programme utile en spé math (Terminale S), pour savoir le reste dans la division de a^n par b selon n
|revpol.zip||2k||07-05-05||Reverse Polish Notation|
REVPOL is a Basic program that allows the TI-83+ and the TI-83+SE to interpret Reverse Polish Notation. This means if you don't like using parentheses, then this is the download for you.
|rootomatic.zip||1k||07-10-26||Auto-start square root simplifier!|
This program saves you lots of time by simplifying square roots (for example: 20^.5 = 2*5^.5). **It also runs immediately when you select it on the program menu. You don't need to press enter on the homescreen. For the auto-start to work, you need to use TiLP2. Read the readme for it to work right!!
This is every Algebra II student's dream come true. This will be your best friend for the week or so that you study simplifying radicals. It even supports roots of negative numbers, just be sure to read the documentation.
This little program finds the value for a root with any index of a real positive number. It iterates quickly for lower indexes to the correct value.
Rounds any number to the nearest hundredth, tenth, whole number, and hundred!
|rpncalculator.zip||12k||05-09-30||Reverse Polish Notation (RPN) Calculator Conversion|
This is an update to my program of a few days ago. I have now included some new functions, including the ability to save! Anyone that enjoys RPN should definitly try this out; others should probably find out what RPN is first. Feel free to email me with comments and suggestions.
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.'
Simplifies square roots, even for large numbers.
|sod.zip||1k||09-04-05||Sum of the Digits of ANY Number!|
Program calculates the sum of the digits of any number no matter how many digits! Fill your Ti's Screen!
|sqrtsimp.zip||1k||08-11-30||Fast Square Root Simplifier|
The name sums it up neatly. This program will simplify radicals (square roots), and do it quickly.
|squarerootreduce.zip||1k||04-02-17||Square Root Reducer|
Reduces a square root i.e. (square root of 75 = 5 times the square root of 3)This tested for bugs i didnt find any, yes this one CAN do negative numbers.
|sum.zip||1k||09-06-05||Sum of Digits|
This is a simple program to calculate the sum of the digits in a real number that differs from 0, for example log(7), sin(45) or 147*36, i.e. you just have to enter log(7), you don't have to enter all the digits by hand. The drawback is that the calculator only holds 14 significant digits.
Also known as the EulerPhi function,it gives the number of numbers < N that have no common factors with N. The algorithim used is very fast and, at only 177 bytes, very efficient as well.
|theradicalprogram.zip||1k||08-08-24||Radical simplifier Ultimate|
a program that simplifies radicals of any degree 1-42
This is a basic math program with the basic operations. Good for learners of math and more user friendly then the regular gui!
|vervierk.zip||5k||03-10-23||Algoritme to find ggd + app:simplify fractures|
This isn't really a program, it just simplifies a fracture with the ggd, but I've put an algoritme to find that, not the function of the calculator itself... See picture! It works fine!
|xgcflcm.zip||1k||03-04-18||GCF and LCM of 2 or more numbers|
*This program is better than any other GCF or LCM zip file. This Program finds, keeps track of, and shows you the LCM and GCF of 2 or more numbers!! THIS PROGRAM IS THE BEST!!*