ensj / primes Goto Github PK

The current fib(n) algorithm generates the nth fibonacci number and just spits that out. Ideally, we'd have it print out 0-nth numbers as an array, and additionally give the nth power of [[0, 1], [1, 1]] (So Pair<array_like, array_like>). We would then have an overloaded version of fib(n) that accepts an array_like as a parameter, so that we can continue off from the nth fib number to the n+mth fib number.

Integrate fib(n), ECFactor(n, r, tries), and FibProduct to start generating pseudoprimes (and perhaps check to confirm that they are pseudoprime)

Refer to title. This is high priority.

We need a good primality test to test if numbers are prime. Pepin's test won't cut it.

From my understanding, rand() only generates 32 bit numbers. (note this may not be an issue at all.)