![]() |
|
|
#12 |
|
Jan 2008
France
2×52×11 Posts |
Yes, but that's pricey (unless the divisor is constant in which case you can replace the div with mul and a small number of low-cost operations): it can be done the way you do it by hand, working in base 2 instead of base 10.
|
|
|
|
|
|
#13 |
|
"Ben"
Feb 2007
2×3×587 Posts |
Fortunately for sieving, division is not in the critical path. When it is necessary, as you say, it can be replaced by multiplication by stored inverses of primes modulo carefully chosen powers of 2.
|
|
|
|
|
|
#14 | |
|
Sep 2010
Scandinavia
10011001112 Posts |
Quote:
200 cores next year. |
|
|
|
|
|
|
#15 | ||
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
Quote:
$35 Raspberry Pi computer sells out on launch Quote:
|
||
|
|
|