| __Name__ | __Size__ | __Date__ | __Rating__ | __Description__ |

| **(Parent Dir)** | *folder* | | **Up to TI-83/84 Plus BASIC Math Programs** |

| **factoring** | *folder* | | **TI-83/84 Plus BASIC Math Programs (Factoring, Primes)** |

| **addition_constantruntime.zip** | 2k | 14-06-30 | | **Addition and Summation using Custom Interval** This program shows the result of adding all numbers between A and B (inclusive) using C as a step or interval value. The time needed for the program to complete is also constant no matter what the input values are. See readme.txt for more information. |

| **addition.zip** | 1k | 05-09-14 | | **Addition Quiz** 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. |

| **addm.zip** | 1k | 01-03-08 | | **Adding Machine** This Program will allow you to do things on your calculator that you only dreamed where possible (Title explans function) |

| **afrac.zip** | 1k | 21-07-26 | | **Afrac v.1.1** Update! Reduces fractions with continued fraction, now with even better precision. Can handle fractions with numerator and denominator of several millions. |

| **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. |

| **anybase.zip** | 1k | 10-03-23 | | **Logorithm Solver** 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. |

| **approxomax.zip** | 20k | 05-01-18 | | **Approxomax** 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). |

| **approx.zip** | 2k | 21-01-24 | | **Approximations** Five programs to give you approximations as fractions of rational and irrational numbers. One program, DFRAC, can also give a correct answer to 17/191+19/193+23/199 and similar fractions. The programs give one to six and more approximations depending of the number and program. |

| **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. |

| **arithmetics.zip** | 6k | 17-02-10 | | **Arithmetics** These six programs offer support for those tedious arithmetic homework tasks, wether you are suposed to add, subtract, multiply, and/or divide. If you are in primary school, they can save you a lot of time and effort. UPDATE: New in this version, ADDMORE, which lets you add up to six numbers. Also, ARITHMET, a menu-driven program containing the five individual programs |

| **avarage.zip** | 1k | 04-06-11 | | **Avarager** this program avarages a list of numbers! |

| **average1.zip** | 1k | 04-03-07 | | **#1Average** 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. |

| **averageit.zip** | 3k | 03-11-19 | | **Average It!** 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! |

| **average_with_weighting.zip** | 2k | 05-09-25 | | **AVERAGE** 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) |

| **avrage.zip** | 1k | 04-02-19 | | **Avrage** Cane make an average from 1, 2, 3, 4, and 5 numbers. Is only a demo of what is to come. |

| **avr.zip** | 1k | 03-10-13 | | **Averaging** This is a basic averaging program that averages multiple numbers, not a fixed one. For more info, see the readme. |

| **axioms.zip** | 1k | 02-04-30 | | **Axioms** 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 |

| **baseconversion.zip** | 6k | 21-04-19 | | **BASECONV&BASECON2&3** These programs convert from any base 2-20, to any base 2-20. BASECONV is for integers and BASECON2 is for floating point numbers. i.e. You can convert a number like 125.875 in decimal to binary, and get 1111101.111. The programs are as simple as possible, with no safety catch built in. So if, for example, you choose from base two to base ten, and input a number like 1134, you will get, 22. There is also the limitation of the 14 significant digits in base 10: the number is first converted to a value memory in base10, so if it has more than 14 significant digits there, information is lost. BASECON3 gives the result as a fraction. If, for example, you input 156.48 in base 10, and convert it to base 16, you get: F48/19. The result is also shown in base 10: 3912/25. |

| **baseconv.zip** | 3k | 14-06-30 | | **Integer and Decimal Base Conversion (base 62 supported)** This program will convert integers and decimals from any base to any base. Stores answer in Ans variable, completely string-based, so all characters 0-9, A-Z, a-z are supported. See readme.txt for more information. |

| **baseops.zip** | 1k | 03-03-27 | | **Base Arithmetic** Add, subtract, multiply, or divide non-base-10 numbers |

| **basicgcdprogram.zip** | 1k | 03-03-10 | | **GCD finder** 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. |

| **bernsteininterp.zip** | 1k | 11-11-05 | | **Bernstein Interpolating** This program will generate the nth order Bernstein interpolating polynomial for a given function f(x). Enjoy! |

| **between.zip** | 2k | 13-04-01 | | **Number in Between** The Property of Betweenness states that there is always another real number in between any two unique real numbers. This program finds a number in between after you input the unique numbers and a fraction. |

| **bigint.zip** | 1k | 01-12-16 | | **BigInt** This program can multiply numbers of infinite length and gives an exact answer. |

| **bigmult.zip** | 1k | 07-12-15 | | **Big-Number Multiplication** 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. |

| **bignum.zip** | 2k | 19-07-20 | | **Big Number Calculations** This program calculates big numbers which are accomplished with either exponentiation, multiplication, division, addition, or subtraction. For example: 789^5, 12345678901234567890/123, 147852369147852369-123456789012345, 12345678901234567890+ 12345678901234567890, 475896123617*963258741236. The operations are entirely list based, so you can get up to 999 digits. Should the result of a subtraction become negative, only the first digit in the resulting list is negative: For example, 191-888=-697, and the answer comes out as, {-6 9 7}. This is to be seen as: -600-90-7, NOT as, -600+90+7, i.e. all the digits are to be seen as negative, if the first one is so. The program also gives the sum of the digits in the resulting list. A bug in the division part has been corrected. |

| **big.zip** | 1k | 21-07-06 | | **Product Digit Counter** Program can count the digits in the product of ANY two integers, no matter how large. |

| **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! |

| **binomialterms.zip** | 1k | 12-06-03 | | **Binomial Coefficients** This program will compute terms for the binomial coefficient. Consider (x+y)^n. The program will ask for n and r (the power on y) and the program will compute the term. Enjoy! |

| **chinrem84.zip** | 1k | 21-04-11 | | **Chinese remainder theorem** This program illustrates the Chinese remainder theorem. The user enters a list of moduli m and a list of remainders r. The program then shows an integer x with x = r[i] mod m[i] for all i. |

| **collatz1.zip** | 1k | 10-12-23 | | **Collatz Conjecture** This program works so that a positive integer N, that you input, is divided by two, if even, multiplied by three and one added, if odd. This process is then repeated until N becomes one, according to Collatz Conjecture. The program displays N's way to one, and then shows the number of operations it took. I enclosed a link on the subject in the textfile. |

| **collatz.zip** | 1k | 10-12-14 | | **Collatz Conjecture** Collatz Conjecture states that any number will eventually reach 1 by following the pattern of divide evens by 2 and multiply odds by 3 and add 1. These two programs will calculate the steps to reach 1 for a specified number and plot the steps vs that number. |

| **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. |

| **dfrac12.zip** | 1k | 15-05-15 | | **DFRAC1&2** DFRAC1: This program is meant to help you with fractions in your schoolwork. It has a much bigger capacity than the built in program. You simply enter the expression, like for example: 1/4 - 8/17, and the program answers: -15/68, and after a while the expression comes up simplified: 17/68 - 32/68. An expression like 1/4 + 2/7*5/3 + 4/11, has the answer: 1007/924, and is simplified to: 231/924 + 440/924 + 336/924. DFRAC2: This program has the same function as DFRAC1, but the execution differs. |

| **dfrac.zip** | 1k | 15-05-15 | | **DFRAC** This program is an improvement of CFRAC, a program which reduces rational numbers. It has capacity to handle fractions and expressions which requires a numerator and denominator of six digits. At the same time it is useful for separating rational numbers from irrational, as opposed to AFrac which has to high a precision. This program is essential when it comes to presenting fractions with the Output(-command, or when you are looking for the rational numbers amongst a set of numbers. |

| **digitalroot.zip** | 1k | 12-07-19 | | **Digital Root** This program will compute the digital root of a number. It will also work with different bases. Enjoy! |

| **doublefactorial.zip** | 1k | 11-12-05 | | **Double Factorial** This program computes the double factorial of an integer greater than or equal to -1. Enjoy! |

| **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. |

| **ealga.zip** | 1k | 02-04-08 | | **Euclidean Algorithm** Creates Euclidean Algorithm in the stat editdor. |

| **edge.zip** | 1k | 02-01-01 | | **Edge v1.40** Gives an idea of how hard a number is to deal with. |

| **efrac.zip** | 1k | 14-12-06 | | **EFRAC** This is an interesting application of Euklides’ algorithm: It is used to simplify expressions of fractions, whereas it’s usually used to find the greatest common divisor and/or the smallest common measurer. This little program has a much bigger capacity than the built in one, and is really fast. An expression like 17/191 + 19/193 comes out as, 6910 over 36863, in a fraction of a second. |

| **egyptian1.zip** | 2k | 12-08-05 | | **EGYPTIAN FRACTIONS** AEGYPT2: This program decomposes fractions into sums of unit fractions: Egyptian fractions. The ancient Egyptians did not write 5/8, but 1/2+1/8, because they didn't have a system for the compact notation m/n, hence the name. They are presented, in general, in descending order, i.e. the denominators get smaller and smaller. The method in this program is to subtract the second biggest, or sometimes the third, or smaller, biggest unit fraction from the number that results in the remainder getting a smaller denominator. This makes it likely, but not necessary, that the next such unit fraction to subtract is bigger than the previous. This is repeated until the remainder itself is a unit fraction. With this method the unit fractions does not become so small as with Fibonnaci's method. When finished, the program pauses a list with the unit fractions, and then shows a list with their denominators. AEGYPT3: This program is different, but works in principle the same way. However it gives the same answers. At least for the numbers I've checked. AEGYPT4: This program is a modification of Fibonnaci's method. It gives pretty much the same answers as the other programs. But here the unit fractions become smaller and smaller in general. AEGYPT0: This program uses Fibonnaci's method. It is submitted for comparison. There is a link to a page on the subject in the text file. |

| **egyptian.zip** | 2k | 12-08-05 | | **EGYPTIAN FRACTIONS** EGYPTIAN: This program decomposes fractions into sums of unit fractions. For example 5/8 is decomposed into 1/2+1/8. The ancient Egyptians did not write 5/8, but 1/2+1/8, because they didn't have a system for the compact notation m/n, hence the name. The program uses a modified version of Fibonnaci's method. When finished, the program pauses a list with the unit fractions, and then shows a list with their denominators. AEGYPT: This program is also a modification of Fibonnaci's method: The program seeks to finish earlier by counting up the unit fraction it is about to subtract with 10 units, and if it finds that the inverted remainder would make an even integer prior to those 10 units, it goes ahead with it. Otherwise it continues as usual with Fibonnaci's method. AEGYPT1: This is a slightly more complicated version, but it will produce the same unit fractions as EGYPTIAN. AEGYPT0: This program uses Fibonnaci's method. It is submitted for comparison. There is an url to a page on the subject in the text file. |

| **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. |

| **factorial.zip** | 1k | 03-08-03 | | **Factorial** 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 |

| **fact.zip** | 1k | 01-03-08 | | **Factorial** 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! |

| **frac1.zip** | 1k | 10-08-16 | | **Fractions** 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. |

| **fraccalc1.0b.zip** | 6k | 05-01-04 | | **FracCalc 1.0** 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. |

| **fractionexpander.zip** | 1k | 07-06-06 | | **Fraction Expander** 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. |

| **fraction.zip** | 3k | 10-09-07 | | **FRACTION** This program consists of five parts: common and continued fraction, approximation of real numbers, decomposing of fractions into sums of unit fractions, called Egyptian, and exact decimal representation of rational numbers, called expansion. It is meant to help in school with various types of fractions. I would be grateful for any comments, suggestions etc. |

| **fractwiz.zip** | 1k | 99-12-05 | | **Fraction Wizard** Converts and Simpilfies Fractions small too! |

| **frac.zip** | 1k | 17-05-30 | | **FRAC and FRAC1** These programs can handle really large fractions, they are limited only by how many digits you can read, provided that there is an arithmetic expression. If you input a number like log(7), you get an approximation, the programs uses AFRAC1 for that. |

| **gcd1.zip** | 1k | 14-11-28 | | **Greatest Common Divisor** Two simple programs to determine the greatest common divisor, when there are more than two values involved. One works like when you do it on paper, and the other one shows the mathematics behind. |

| **gcdlcm2.zip** | 1k | 14-12-10 | | **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 subroutine in a program that factors quadratic equations with rational coefficients, for example. I use it in QUADRA12. It doesn't matter in which 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. GCDLCM2: This program is for integers only. |

| **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. |

| **gcf84.zip** | 1k | 14-04-17 | | **Greatest Common Factor ** This is a greatest common factor program for the Ti-84. The user enters in a list of positive integers and the program will find the GCF. Enjoy! |

| **gcf.8xp** | 1k | 01-12-22 | | **GFC** 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. |

| **goldbach1.zip** | 3k | 11-03-06 | | **GOLDBACH** 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! |

| **goldbach.zip** | 1k | 09-10-15 | | **Goldbach Conjecture** 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). |

| **goldenratio.zip** | 1k | 03-03-07 | | **Golden** Calculates the exact value of the Golden Ratio using the quadratic formula, no need for recursive programming! |

| **golden.zip** | 1k | 11-03-16 | | **Golden Ratio** 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** | 8k | 15-05-19 | | **IMAGIC** This is a very small ( 46 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 |

| **jbpprimetester.zip** | 1k | 04-02-16 | | **Prime Tester** 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. |

| **kaprekar.zip** | 3k | 14-11-19 | | **Kaprekar's Constant** Take any 4-digit number that does not repeat the same digit, and sort its digits in ascending and descending order, to get two numbers. Then subtract the smaller number from the bigger and repeat the process with the number you then get, and you will find yourself with 6174 as a result, in less than 8 iterations! There are also at least five more constants, in bases other than 10, that follow from the same procedure. |

| **laguerreiteration.zip** | 1k | 11-11-08 | | **Laguerre Iteration** This program performs Laguerre iteration to determine the roots of polynomials. It is third order convergent for simple zeros. Enjoy! |

| **lastintegers.zip** | 1k | 03-03-07 | | **Last Integers** 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! |

| **lcm83p.zip** | 1k | 03-04-03 | | **LCM v1.0** 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! |

| **lcm.8xp** | 1k | 01-12-22 | | **LCM** 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. |

| **lcm.zip** | 1k | 14-11-28 | | **Least Common Measurer** Two simple programs to determine the least common measurer, when there are more than two values involved. One works like when you do it on paper, and the other one shows the mathematics behind. |

| **leastdiv.zip** | 1k | 07-05-16 | | **Least Divisible** This program finds the first number that is divisible by something starting from a certain integer and testing at a certain increment. Pictures attached. |

| **logaritm.zip** | 1k | 11-03-06 | | **Logarithm Solver** 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. |

| **logsolve.zip** | 1k | 09-04-04 | | **Logarithm Solver** Solves for any logarithm. loga(b)=x. Give two variables and you get the third. Really, that's it. |

| **longdivision.zip** | 1k | 06-05-25 | | **Long Division** 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. |

| **longdiv.zip** | 1k | 02-01-16 | | **Long Division** 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. |

| **megalcm.zip** | 1k | 09-03-24 | | **Mega LCM** 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 @ ezekielvictor@hotmail.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! |

| **modcalculator.zip** | 2k | 12-02-29 | | **Mod Calculator** A powerful program which can perform modular arithmetic. Tested integers work into the low (<100) trillions. |

| **modexp.zip** | 1k | 01-08-05 | | **Modular Exponentiator** Raises numbers to a power in modulo arithmetic. |

| **mods.zip** | 1k | 03-04-01 | | **Modulo Residue** This simple program asks for mod M, a number P, and gives you the residue of P mod M. |

| **modulararithmetic.zip** | 1k | 05-05-01 | | **Modulo** Does modular arithmetic for modularly-challenged people. Is very small (exactly 100 bytes) and very fast. |

| **modular.zip** | 1k | 01-06-15 | | **Modular Divisor** Performs modular division |

| **modulo1.zip** | 1k | 11-05-14 | | **Modulo** This program gives you the modulo of two integers. It is very small. The active part of it has only got 15 bytes, so you can easily use it as a subroutine in any of your programs. It uses memories A, B, and C. |

| **modulo.zip** | 1k | 02-07-23 | | **Modulo** performs modulo using two variables |

| **modulus.zip** | 1k | 02-05-11 | | **Modulus** Finds the Modulus of a complex number (a+bi) |

| **mod.zip** | 109k | 03-07-16 | | **MOD** It calculates the remaining portion of the division of x for y. x mod y=r |

| **morefactorials.zip** | 1k | 14-11-14 | | **More Factorials** This program will compute factorials for fractions with denominators 3 and 4 (the calculator already handles denominators of 2). It uses a recurrence relation rather than the Gamma function. Enjoy! |

| **mrcount.zip** | 1k | 03-11-19 | | **Mr.Count** 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! |

| **multinomialterms.zip** | 1k | 14-03-23 | | **Multinomial Terms** This program computes the coefficients in a multinomial expansion. Please read accompanying documentation for more information. Enjoy! |

| **multiple.zip** | 1k | 02-11-20 | | **Multiple** Will find all multiples of any real positive integer within memory limitations of calculator. Can be very helpful in factoring. |

| **multiply83p.zip** | 1k | 02-02-25 | | **Multiplication Teacher** Due to the amount of people that can not multiply in my school, I made this. It helps you learn to multiply. |

| **numberofdigits.zip** | 1k | 12-07-06 | | **Number of digits** This program will produce the number of digits for a positive number. Very small. Enjoy! |

| **numberofdivisors.zip** | 1k | 11-12-20 | | **Number of Divisors** This program will factor a positive integer and it will also produce the number of divisors for the number. Enjoy! |

| **numbers.zip** | 1k | 06-09-08 | | **Numeric Functions** 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. |

| **operatio.zip** | 1k | 03-03-10 | | **Operations** It makes addition, subtraction, multiplication, and division easy for people. (Run program output) |

| **pchange.zip** | 1k | 06-12-10 | | **Proportion Finder** 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. |

| **percentf.zip** | 1k | 03-12-07 | | **Percent Change** 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 |

| **percentrx.zip** | 1k | 03-09-16 | | **Percent Finder** This finds percent. |

| **percentsolver.zip** | 8k | 04-12-16 | | **Percent Solver** 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! |

| **perfect1.zip** | 2k | 10-03-31 | | **Perfect Numbers** 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. |

| **perfect.zip** | 1k | 01-05-31 | | **Perfect ** 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. |

| **pochhammer2.zip** | 1k | 12-04-25 | | **Pochhammer 2** This program computes the falling factorial, while my first Pochhammer program computes the rising factorial. Enjoy! |

| **polyeval.zip** | 1k | 13-06-18 | | **PolyEval** This program will evaluate polynomials, but this program works if the coefficients or the input value is complex. The user inputs the coefficients of the polynomial in ascending powers order and then the value. The program returns the evaluation. Great for students being introduced to complex arithmetic. Enjoy! |

| **powermodulus.zip** | 1k | 08-12-19 | | **PowerMod** Calculates powers with respect to a modulus, i.e. a^b (mod n) using the fast exponentiation algoritm. |

| **powermod.zip** | 1k | 04-09-27 | | **PowerMod** 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! |

| **powersum.zip** | 10k | 23-09-05 | | **Powersum** The sum of the n-th powers of the first k integers is a polynomial of degree n+1 in k. This program computes the coefficients of this polynomial. |

| **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. |

| **primefactor.zip** | 1k | 09-06-23 | | **Prime Factorer** 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. |

| **primetest.zip** | 1k | 13-02-11 | | **Prime-test** * Prime-test This program will test (darn quickly) how prime a number is, and display the first proof it finds if a number is composite. Try it- it's pretty quick. If you want real speed though, you'll write one in assembly. |

| **prootsimplifier.zip** | 2k | 12-04-07 | | **P-root Simplifier** This program displays the results symbolically of simplifying square roots, cube roots, fourth roots etc. The user inputs the number in the radicand (must be positive) and the index on the radical. The program outputs the factor outside the radical and the new radicand. Enjoy! |

| **prop1.zip** | 1k | 12-07-01 | | **Proportion Checker/Solver** 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! |

| **proport.zip** | 1k | 03-12-28 | | **Proportion Solver/Checker** 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 |

| **quotientv1.1.zip** | 1k | 10-06-04 | | **Quotient v1.1** 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. |

| **ratio1.zip** | 2k | 01-02-22 | | **Ratio1** This is a fairly simple program that makes it easy to work with, simplify, and expand simple ratios and proportions. |

| **ratio_solver.zip** | 1k | 04-03-02 | | **Ratio Solver** 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 ezekielvictor@hotmail.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!- |

| **reduce1.zip** | 1k | 08-06-12 | | **Reduce** 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. |

| **remaindersolver.zip** | 1k | 05-09-13 | | **Remainder Solver** You input a fraction, and it tells you the quotient and the remainder. Useful for earlier math classes, but can be used with any! |

| **remainder.zip** | 1k | 03-12-22 | | **Remainder Finder** Insert the dividend and divisor and the answer + remainder is given (rather than the a decimal answer). E-mail Me at ezekielvictor@hotmail.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. |

| **remain.zip** | 1k | 04-01-03 | | **Remainder Finder** 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. |

| **rest_z80.zip** | 2k | 05-04-27 | | **Rest** [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!! |

| **rootsimp.zip** | 7k | 06-01-13 | | **RootSimp** 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. |

| **roots.zip** | 1k | 17-01-13 | | **ROOTS** ROOTS: This program calculates the roots for any index: 2, -3, 4â¦, 1/2, 1/3, -4/3â¦, when x and y in xây are rational . So the program then relies on general formulas. Other than that, the built in formulas are used. So instead of just one root for every index, you get them all, plus their angles, provided x and y are rational. ROOTS1: If the above program is mostly for the math nerds, this program is a useful subroutine since it is short and also, like the other, does not miss out when the answer is an integer, which often happens with the built in xây: 3â7^3, ( MATH 4 ) for example, gives an fPart = 1. Answers are the same as xây. ROOTS2: This is a short and useful program, which does not miss out when the answer is an integer. Can handle imaginary/complex answers as well. |

| **rounder.zip** | 1k | 10-12-04 | | **Rounder** rounder is a neat little program that can round any number to a set decimal place. it is simple to use, just start it normally. |

| **round.zip** | 1k | 05-09-14 | | **Number Rounder** 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. |

| **rpn.zip** | 23k | 11-05-13 | | **Reverse Polish Notation** ARPN: This program gives you RPN ( Reverse Polish Notation ), on your 83/84 Plus. You can use all of the functions on the calculators buttons, such as sin(, cos(, tan(, log(, ln(, etc. You can also use some functions in the MATH menu, but you can not use any of the various tests or logic. ARPN1: This program gives you RPN ( Reverse Polish Notation ) on your 83/84 Plus. It differs from ARPN in that you press ENTER after every input. Like ARPN it has a stack of four numbers, and you can use all the functions on the calculators buttons, and the same functions in the Math-menu, and you can also do complex numbers. More information in the text files. |

| **simplify.zip** | 3k | 13-01-02 | | **Decimal Simplifier** 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.' |

| **simpsqrt.zip** | 1k | 08-01-31 | | **SmpSqrt** 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! |

| **sqrtcalculator.zip** | 2k | 17-11-18 | | **Arbitrary Precision Square Root Calculator** This program will allow you to calculate the square root of an inputted number to as many decimal places as you prefer. This is more accurate than your calculator will normally give you! Also included is a program to calculate the golden ratio, phi, using the same algorithm. |

| **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. |

| **squareroot3rdorder.zip** | 1k | 14-04-20 | | **Square Root 3 Order** This is a program for computing the square root of a real number (it will handle negative real numbers) but it is a third order convergence scheme. Useful for programmers and analysts. Enjoy! |

| **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. |

| **stevie20.zip** | 1k | 21-08-03 | | **Stevie2.0 Division ** Simple program performs division with integer remainders. |

| **sumofsquares.zip** | 5k | 14-10-13 | | **Sum of Two Squares** This program splits numbers into the sum of two squares (it will tell you if this is impossible). If given two numbers, the program will also split the product of those two numbers. |

| **sum.zip** | 1k | 12-06-17 | | **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. |

| **tf.zip** | 1k | 04-08-03 | | **Totient Function** 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 |

| **timath.zip** | 1k | 03-10-27 | | **Ti-Math 1.0** 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!!* |

| **zeller.zip** | 1k | 12-10-15 | | **Zeller's Congruence** By: Michael Conard Thank you for downloading my Zeller's Congruence program! This took a lot of trial and error, but I finally got it. Zeller's Congruence calculates what day of the week it is using arithmetic, I studied the formulas for a while and have been able to calculate it on paper and in my head in under 20 seconds now. It is extremely efficient, and I prefer it to a calendar. |