tivins / lnprime

A program used to compute large prime numbers

👋 Hi, I’m @tivins, (AKA Syscall, on StackOverflow)

= + + ;

lnprime's Issues

Check memory usage in next_prime() function.

Change implementation if next_prime() to limit amount of memory used by the function.

Optimize the detection of `x` in `x(20p+x)`.

The process is currently made in ln_sqrt() function. The call to x20ppx() function, is made inside another loop to detect the greatest version of x.
From "methods of computing square roots" :

Note: x can be found by guessing what c/(20·p) is and doing a trial calculation of y, then adjusting x upward or downward as necessary.

The task is to remove this loop (or limit its processing time).