Various integer routines.

Ways of computing prime numbers, OEIS A000040.

• Sieve, a sieve of Eratosthenese.
• PQueue, a priority queue.
• SPRP, a strong probable-prime test.
• Segment, a parallel segmented sieve.

Computation of swinging factorials, OEIS A056040.

Ways of computing the factorial, OEIS A000142.

• Split Recursive, very efficient and without computation of prime numbers.
• Prime Swing, most efficient for large numbers. Involves computing swinging factorials, which in turn involves computing prime numbers.
• Double Factorial OEIS A001147.

Efficient computation of the binomial coefficient.

Some simple support functions.