|(Parent Dir)||folder|| ||Up to TI-89 BASIC Math Programs (Arithmetic)|
|bprime.zip||1k||00-08-29||Prime Factor v1.0|
Highly optimized program will factor a number that you input. Amazing speed for BASIC!
|conicompletesq.zip||1k||09-09-06||Conic Completing Square|
many conic equations are entered in the form ax^2+bx+cy^2+dy+e=0. this program manipulates the equation in the form that may look like(x+1)/3 + (y-4)/2
A very powerful program which find all positive dividers of a number. Un programme très puissant qui trouve tous les diviseurs d'un nombre.
Same functions as factor([integer]) but programmed in BASIC ;-)
Programme determinant le diviseur communs de 2 nombres et cela de façon detaillé (il n'y a plus qu'a recopier sur la copie), ce programme permet aussi de connaitre tous les diviseurs d'un nombre.
|divlist.zip||4k||01-12-16||Dividers list/liste des diviseurs |
Determines the positive integer dividers list, and checks whether a number is perfect
|ephi.zip||4k||11-10-26||Euler's Totient (Phi) Function|
Function that returns the number of integers less than the integer input that are coprime (relatively prime) to the input. Useful in number theory when working with modular arithmetic and congruences of powers.
|factall.zip||4k||03-06-24||FactAll - Quickly Find All Factors|
factall() is a TI-89 basic program that finds all factors of an integer. The built-in factor() function only finds prime factors; factall() uses this function to compute additional factors (including composite factors). Useful on the SAT.
Hopefully the last release of the well balanced factor program (speed and size) for the 89. This latest release was made when the author realized how much faster the fpart() function was that modulus...increasing factor speed by 1.5-3 times... A Pyrosoft Production
This program calculates all the factors of a number (not like the built-in function "factor(n)", which just finds the prime factors).
This is a port of the 86 factoring program. This tiny program produces fast, accurate results with great efficiency. It doesnt have any annoying menus for something so simple.
Will find all factors of the number entered into the parenthesis. Works like a function. All factors are stored in a list for later viewing.
Contains two functions: mgcf and mlcm. mgcf computes the greatest common factor of a list (of any number of integers). mlcm computes the least common multiple of a list (of any number of integers). There also is no error when something other than a list is passed; the function will just return 0.
A powerful function that returns the smallest prime greater than the number provided as an argument. This program works very quickly considering it uses merely 101 bytes of memory and is far better than manually testing every odd number greater than a given one.
list prime numbers
|premnbr.zip||7k||00-10-13||Prime Numbers (French)|
programes on the prime numbers
|prime89a.zip||1k||03-03-18||a prime number solver|
this program, made by michael youssef, finds prime numbers. it is very very very useful. you dont know how often you need it. email me at email@example.com
|primefinder.zip||1k||00-06-13||Prime Number Finder v1.0|
Generates a list of the prime numbers found within a specified interval. Very fast.
Here in this group file are some prime number functions based on the built in prime number test. There are no prime functions, built in, only the tester. The primary prime function returns which prime number you want, 2 being the first. Relatively fast.
|primegen.zip||1k||00-04-13||Prime Number Tester|
This program tests a number for primality, then displays its factors if it is prime
|primes_1_100000.zip||118k||03-03-10||Primes: 1 - 1,000,000|
These lists contain all the primes, 1 to 1,000,000. Each of the 20 lists contains all the primes in each set of 50,000.
This factors ANY # into primes, with negative and decimal support (1st time ever).
|primes.zip||22k||00-08-23||The First 14,423 Prime Numbers|
This is a list of the first 14,423 prime numbers
Find prime numbers greater than a specified value.
|prime.zip||1k||98-10-16||Prime Number Program|
Determines whether a whole number is prime or composite and lists its factors.
A very small, very easy program that will find the prime factorization of every number.
|primt.zip||4k||05-09-25||Lucas and Perrin Prime Tests v1.0|
Two probablistic prime tests involving the Lucas and Perrin Sequences. They are implemented by using modular exponentiation with the Q-Matrix method for time-efficient results. Functions return 'true' or 'false' for a given integer argument. Can test 64-digit integers in just under a minute.
This is a very small program that tells you if two numbers are relatively prime or not. Great for math class!
This is a cool little program that lets you input a number and it will give you the sum of all its whole number factors.