Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality. Learn more →
Primesieve Alternatives
Similar projects and alternatives to primesieve based on common topics and language
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
NOTE:
The number of mentions on this list indicates mentions on common posts plus user suggested alternatives.
Hence, a higher number means a better primesieve alternative or higher similarity.
primesieve reviews and mentions
Posts with mentions or reviews of primesieve.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-07-02.
-
The Sieve of Atkin
This is a fascinating Q&A where user GordonBGood analyzes the performance of the Sieve of Atkin and compares it to that of Eratosthenes with a view to practical implementations.
The fast prime generator project primesieve is also relevant: https://github.com/kimwalisch/primesieve
- Primesieve: Fast Prime Number Generator
-
How to implement wheel factorisation?
I've come across this excellent prime sieve on GitHub, and I just want to find out how it generally works. Yes, it's written in C but I plan to make a Python version that uses some of its methods to make a fairly quick prime sieve. However, I'm really not sure how it has implemented wheel factorisation, and no matter how hard I look online, I can't find a good execution of it that works with its segmented approach. Does anyone have any idea how the wheel factorisation is implemented? To my understanding it's a modulus array that tells you which numbers modulo n are definitely not prime leaving you with the candidate primes to check, but I'm not sure how you would implement this inside a segment so that you only check the candidate primes. In the prime sieve on GitHub it somehow finds the next multiple of the prime using its lookup tables, which I cannot decipher.
-
Dave's Garage: Sieve of Eratoshenes Competition
Implementation: https://github.com/kimwalisch/primesieve/wiki/Segmented-sieve-of-Eratosthenes
-
https://np.reddit.com/r/programming/comments/o0x6pk/i_made_a_63_line_prime_number_finder_in_rust_over/h1yev0g/
Here another version that still run fast (between 15 and 20ms). A better implementation of the sieve of Eratosthenes is primesieve. You could also use the sieve of Atkin.
-
I built a prime number finder for fun (over 3000 primes found .3 seconds)
Well, that's fine and all, but factually, its very slow: - https://github.com/kimwalisch/primesieve achieve over a billion prime in the same amount of time
-
high precision text-data-files for Phi, Pi and e ?
The list of primes at primes.utm.edu contains just 50 million primes. A program like Primesieve by Kim Walisch can compute them in a fraction of a second.
-
I understand why the borrow checker won't allow this. But what's my Rust-idiomatic alternative?
There are approximately 193 million primes under 232 which is the square root of 264, you quickly generate a list of all primes using https://github.com/kimwalisch/primesieve - and then do trial division in paralelle on your input set using rayon.
-
A note from our sponsor - InfluxDB
www.influxdata.com | 23 Apr 2024
Stats
Basic primesieve repo stats
8
898
9.4
7 days ago
kimwalisch/primesieve is an open source project licensed under BSD 2-clause "Simplified" License which is an OSI approved license.
The primary programming language of primesieve is C++.
Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com