Search results

Uses sieves for the prime factor sums and prime divisor sums, assumes that the first Ru ...

The classic David Turner's 1983 (1976? 1975?) SASL code repeatedly ''sieves'' a stream of candidate numbers from those divisible by a prime at a time, Explicating the run-time list of ''filters'' (created implicitly by the sieves above) as a list of ''factors to test by'' on each segment between the cons ...

Uses sieves, counts 1 as a multiplicatively perfect number.<br> ...

Now these functional incremental sieves are of limited use if one requires ranges of billions as they are hundreds ...generation algorithm outlined in the paper, "Two Compact Incremental Prime Sieves" by Jonathon P. Sorenson. This algorithm is essentially a rolling segmented ...

...n using a prime sieve, but the primeSieve function is quite slow for large sieves. Since calling task(N) with N equal to 1e7 is sufficient to achieve the pr ...

(*) For large sieves, gojq will consume a very large amount of memory. ...

Although they use a lot of memory, sieves usually produce good results in Wren and here we only need to sieve for pri ...

Simple brute force (no sieves, memoization or bigint.ProbablyPrime) as there is not much need for speed h ...

# Fill both sieves in a single pass. ...

the specification as closely as possible (no prime sieves or calls ...

...wheels), packing the sieve into bits to improve locality (and allow larger sieves), etc. ...lang="chapel">// yield prime and remove all multiples of it from children sieves ...

{{task|Sieves}} ...

;; each number; rather sieve them. Prime sieves by their very nature are at least memory bound... ...

...g one number) and [[Sieve of Eratosthenes]]. The latter has trial-division sieves in it, that really don't belong but can't properly go into the former. They ...

Often short functional sieves are not a true implementations of the Sieve of Eratosthenes: ...