Contents

#ifndef H_PRIME_GEN
#define H_PRIME_GEN
long * primes(int length);

//Generation of primes is currently time-prohibitive when generating up to large maximums.
//This should be acceptable for prime factorization because although naive the algorithm is
//somewhat optimized to detect relatively large prime factors.
long * primes_upto(long max);
long * prime_factors(long n);
#endif

Version data entries

3 entries across 3 versions & 1 rubygems

Version	Path
congruence_solver-0.5.2	ext/congruence_solver/prime_gen.h
congruence_solver-0.5.1	ext/congruence_solver/prime_gen.h
congruence_solver-0.5.0	ext/congruence_solver/prime_gen.h