primesieve

command
v0.28.0 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Dec 21, 2023 License: MIT Imports: 0 Imported by: 0

Documentation

Overview

Primesieve is a concurrent prime sieve. That is an algorithm for finding prime numbers. It's done by removing composite numbers, i.e. positive integers that have at least one divisor other than 1 and itself.

Taken from https://youtu.be/f6kdp27TYZs?t=2208.

Level: advanced Topics: algorithms, math, concurrency

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL