nortega/indivisible-legacy
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fixed problem with the algorithm.

Browse Source 
If it's equal to half then we want to check if it's divisible, since if
it's half then it is NOT prime.
This commit is contained in:
Nicolás A. Ortega 2016-12-13 18:05:02 +01:00
parent a9019291c2
commit 06d5ddb0cc
No known key found for this signature in database
GPG Key ID: 614272579C2070D1
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/main.c
View File

@ -44,7 +44,7 @@ int main(void) {
mpz_fdiv_q_ui(halfNum, num, 2); mpz_fdiv_q_ui(halfNum, num, 2);
// Loop through found primes // Loop through found primes
for(ulli i = 0; i < primes.end; ++i) { for(ulli i = 0; i < primes.end; ++i) {
if(mpz_cmp(primes.list[i], halfNum) >= 0) break; if(mpz_cmp(primes.list[i], halfNum) > 0) break;
// If `num' is divisible by a prime then go to the next number // If `num' is divisible by a prime then go to the next number
if(mpz_divisible_p(num, primes.list[i]) != 0) if(mpz_divisible_p(num, primes.list[i]) != 0)
goto nextPrime; goto nextPrime;