Program:	Abigsiv
Author:	Rob Gaebler
Date:		2/18/99

	The program is simple to run.  Just enter a number (positive integer), and ABIGSIV will find all the prime factors of the number.  The factors are displayed in a matrix, as explained below.
	ABIGSIV is by far the fastest number factoring program ever made for the TI-83.  In fact, it is faster than any ever made for the TI-80, TI-82, TI-85 or TI-86, and that includes PRIME6 for the TI-85.  ABIGSIV is 9 times as fast as any other factoring program for th TI-83 (except for FACTRIZE, also written by me; ABIGSIV is only 3 times as fast as that).  ABIGSIV is almost twice as fast as PRIME6, the celebrated TI-85 program.
	Here are some statistics to show how fast my program is:

Number			Factorization	Length		Time for ABIGSIV
999983			prime			6 digits		4 seconds
9999991			prime			7 digits		11 seconds
99999989			prime			8 digits		30 seconds
999999937			prime			9 digits		1minute, 34 seconds
9999999967			prime			10 digits		4 minutes, 58 seconds
99999999977			prime			11 digits		15 minutes, 54 seconds
999999999989		prime			12 digits		50 minutes, 45 seconds
19999999999997		prime			14 digits		3 hours, 52 minutes, 46 seconds

17439280249			55511*314159	11 digits		2 minutes, 49 seconds

	ABIGSIV is superior to other factoring programs in other ways, too.  It is very small for such a powerful program (only 380 bytes), and that can be shortened to merely 192 bytes or so by taking out most of the frills, without reducing the program's speed at all.

Here are some more special features of ABIGSIV:

	Prime factors and their powers are displayed in a matrix, with the factors on the left and the corresponding powers on the right.

	The matrix is updated whenever any factors are found.  This can sometimes be very useful, such as when you just want to find out if a number is prime, because you don't have to wait for ABIGSIV to completely factor the number.

	In the lower left corner of the screen is a counter that displays how far the program has searched for factors so far.  If you want to know what percent of the way done the program is, remember that it only has to search up to the square root of the number it is factoring.  So you might need to find the square root of the number ahead of time, but that really isn't a problem.

	Any number up to 2e13 (2*10^13) can be factored accurately.

	Super-fast modulo-210 and If:end technology are the secret to the awesome speed of the program.

I do not care if you or anyone else edits, revises, changes, dismantles, or in any way alters ABIGSIV, as long as you don't put it on the net under your name.  I also don't mind if you copy the program and distribute it among your friends.  In fact, I encourage it!

Note: ABIGSIV uses list FCTR, so make sure you get it on your calculator, and do not mess with it or replace it.

You can contact me with questions or comments at my Dad's e-mail address, Rfgaebler@sprynet.com.