stripped down the code in frobenius_allinone.py even more

Polynomials are now just a list of two coefficients [a,b] representing
the polynomial ax+b.
Changed Python implementation of RQFT to use a different style of trial division
Move python implementation to its own directory
add comment to describe what split does in the python all-in-one implementation
Rewrite Makefile to support testing and machine integer versions
move some code around
remove unused variables in miller_rabin.c
add rules for building and running tests to Makefile
Implement the Miller-Rabin test using ints

I created a copy of the Miller-Rabin code that uses unsigned longs
instead of mpz_t to hold the numbers.  This limits the test to 32 bit
numbers. (Larger numbes will, when multiplied, produce results to large
to fit into a register, so the results will be cut off, making their
reduction modulo n plain wrong.)

This implementation can be used to run the Miller-Rabin test on all odd
numbers in the intervall [5, 2^32].  It is mainly intended to compare
the runtime and error rate to the RQFT.
Implement the RQFT using machine words

This commit adds an implementation of the Randomized Quadratic Frobenius
Test for odd numbers up to 2^32.
add implementation of RQFT using GMP
minor code cleanup in miller_rabin_int.c
Cleanup in polyonimal arithmetic functions

Common subexpression elimination, reformatting long lines.
Add alternative implementation of Jacobi symbol

This patch adds the implementation of the Jacoby symbol from PARI (just
copied the code).  Does not seem to have much influence on performance
an is thus in a comment for the time being.
Change the integer version of split to return void
Rewrite code for easier testing, including Makefile
Refactor code in frobenius_int.c and fix int_sqrt

Change the int_sqrt implementation to work for number that are to large
to get a good estimate of the integer square root by converting to
double, taking the square root and truncating the result.  The new
implementation is not particularly good, as the floating point
approximation is used as a starting point, from which *every* integer
is tested until one is found which is larger than the square root.  The
one before that will then be returned.

Remove all "_long"-suffixes, as the GMP implementation is the main one.
Move the code handling the first two steps into a new function which
only takes the integer square root once instead of twice and reduces
some code duplication.
Fix a bug in QFT_int, refactor code a little
Makefile cleanup
General code cleanup (including uncrustifying)