You don't need to use sqrt() to do the optimization.Originally Posted by abachler
Code:result = possible_prime / possible_factor; if(result < possible_factor) { /* Obviously, we've crossed the square root at this point. */ }
You don't need to use sqrt() to do the optimization.
Code:result = possible_prime / possible_factor; if(result < possible_factor) { /* Obviously, we've crossed the square root at this point. */ }
HEY you've been looking at my notes
Actually I just do that step to determine if I need to Root++
different implementation, btu the same core method. The reason I increase root by 2 is we will only be checking odd number factors anyway.Code:if(Prime / Root > Root) Root+=2;
Last edited by abachler; 02-07-2008 at 09:26 AM.
then try this -
Code:if(!(Prime & 1)) return FALSE;
it was a joke, checking Prime in any way will do you no good here... As was said - you need to test the value of Target
All problems in computer science can be solved by another level of indirection,
except for the problem of too many layers of indirection.
– David J. Wheeler
oh gawd, yeah i totally missed that one, it shodul be
thanks for catching that nub mistake vartCode:if(!(Target & 1)) return FALSE;
BTW, for anyone that tried to D/L the primes in the last few days and got a service message, the site is back up and running. Sorry I forgot to pay the bill
Last edited by abachler; 02-07-2008 at 03:21 PM.
