FreeBSD.software
Home/math/primesieve

primesieve

12.9,1

Fast prime number generator

primesieve is a program and C/C++ library that generates primes using a highly optimized sieve of Eratosthenes implementation. It counts the primes below 10^10 in just 0.4 seconds on an Intel Core i7-6700 CPU (4 x 3.4 GHz). primesieve can generate primes and prime k-tuplets up to 2^64.

Origin: math/primesieve
Category: math
Size: 469KiB
License: BSD2CLAUSE
Maintainer: yuri@FreeBSD.org
Dependencies: 0 packages
Required by: 2 packages
Website: github.com/kimwalisch/primesieve
$pkg install primesieve

Required By (2 packages)

openturnsprimecount

More in math

py311-numpy1.26.4_11,1
The New Numeric Extension to Python
R4.5.2
Language for statistical computing and graphics
gmp6.3.0
Free library for arbitrary precision arithmetic
openblas0.3.30,2
Optimized BLAS library based on GotoBLAS2
fftw33.3.10_5
Fast C routines to compute the Discrete Fourier Transform
py311-matplotlib3.8.0_2
Plotting library uses a syntax familiar to MATLAB users
py311-pandas2.3.3,1
Flexible, high-performance data analysis in Python
mpfr4.2.2,1
Library for multiple-precision floating-point computations
octave10.3.0_2
High-level interactive language for numerical computations
octave-forge-base1.9_1
Octave-forge baseport for all packages