Questions tagged [sieve-of-eratosthenes]
The Sieve of Eratosthenes is a prime-finding algorithm developed by the ancient Greek mathematician Eratosthenes. It works by writing down as many numbers as needed and then, traversing from lowest to highest, cross out all multiples of a number, beginning with 2. The numbers that remain are considered prime and the lowest of it will be used for the next run.
3
votes
2answers
84 views
Sum of primes up to 2 million using the Sieve of Eratosthenes
I've solved question 10 on Project Euler using the Sieve of Eratosthenes, what can I do to optimize my code?
...
11
votes
3answers
2k views
Prime sieve in Python
I was trying to write Sieve for the first time and I came up with this code:
...
5
votes
1answer
49 views
Prime Sieve and brute force #2
Based on my previous attempt.
Prime Sieve and brute force
Trying to make the interface simpler I have moved all the code into a class. This way I can keep track of the ...
14
votes
3answers
1k views
Prime Sieve and brute force
Got caught up with this morning's C++ question.
So I thought I would have a go.
SO here is my attempt at printing the first 1001 primes.
...
8
votes
3answers
157 views
3
votes
1answer
36 views
Efficiency of a recursive implementation of the Sieve of Erasthotenes in Python
I implemented the Sieve of Erasthotenes recursively using filter and I was wondering how efficient this implementation is and wether a non-recursive implementation ...
4
votes
2answers
92 views
Incremental Sieve of Eratosthenes using iterators
I am in the process of learning Rust and am still having some issues with borrowing and ownership. I find myself trying to borrow mutable references that are already borrowed as immutable references ...
1
vote
0answers
54 views
Incremental Sieve of Eratosthenes using unstable generators [duplicate]
I am in the process of learning Rust and am still having some issues with borrowing and ownership. I find myself trying to borrow mutable references that are already borrowed as immutable references ...
2
votes
1answer
76 views
Simple Sieve of Eratosthenes in Python 3
So yet another Sieve of Eratosthenes in Python 3.
The function returns a list of all primes smaller but not equal max_n.
The motivation is, as a practice, a ...
0
votes
1answer
102 views
Fast Prime Sieve (Python Implementation)
A modified version of the prime sieve. I actually doubt it could be implemented any faster, but I might be wrong:
...
0
votes
1answer
50 views
Computing a prime table in Rust
My objective is computing a table of primes up to n, where n is a natural number passed as an argument to the prime_table function.
Here is src/lib.rs:
...
2
votes
1answer
127 views
Faster Sieve of Eratosthenes
This is an implementation of the Sieve of Eratosthenes :
It takes advantages of the fact that all primes from 5 and above can be written as 6X-1 or ...
2
votes
2answers
70 views
Project Euler #10 (sum of primes less than two million) in Clojure
I'm new to Clojure and using some Project Euler problems to familiarize myself with the language's capabilities. Problem #10 asks to find the sum of all primes less than two million.
I wanted to ...
0
votes
3answers
84 views
3
votes
2answers
132 views
Sieve of Eratosthenes in Rust
This is a relatively simple implementation of the Sieve of Eratosthenes in Rust. The main objective is to find the \$n\$th prime quickly when \$n\$ might grow to huge numbers.
...
0
votes
2answers
81 views
Prime number generation - SPOJ
This is a program to generate prime numbers for a given range. The sieve of Eratosthenes algorithm was implemented, but still the SPOJ says time limit exceeded. Where can some optimizations be made?
...
6
votes
2answers
100 views
Prime number segmented sieve
I tried to solve the SPOJ prime number problem below. The code produced correct results, but Time limit exceeded and also memory need around 970M which is not efficient(?)
How can I optimize this ...
4
votes
1answer
137 views
Sieve of Eratosthenes in Python
This is yet another take in Python for the infamous Sieve of Eratosthenes. I am a beginner in Python so any criticism is highly appreciated.
...
1
vote
0answers
96 views
Get prime divisors of an Int32 using a wheel
I recently played around with prime factorization using a prime wheel. Much of the heavy lifting is done by the PrimeWheel class. I think the implementation is ...
0
votes
1answer
617 views
Find primes using Sieve of Eratosthenes with Python
I was Googling for a 'correct' or 'efficient' implementation of the Sieve of Eratosthenes. I found them all more complicated than what I came up with. I am by no means a Python expert, so I was ...
3
votes
1answer
158 views
Functional Sieve of Eratosthenes in Clojure
For some reason, this is the first time I've ever written an implementation of the Sieve of Eratosthenes. I basically just stared at the Wikipedia walkthrough of the algorithm until it made sense, ...
1
vote
2answers
338 views
Finding the size of the largest connected component in a graph
Given this question, which simply can be explained as follows:
Given the number of nodes and the number of edges in a graph, find the size of the largest connected component of the graph. If this ...
4
votes
4answers
332 views
8
votes
1answer
979 views
Prime Number Generator in Swift
I would like to make (or improve my function) a function that returns an array of integers containing all the prime numbers from 2...n that can execute as quickly ...
4
votes
2answers
298 views
Sieve of Eratosthenes for small limits
I coded a sieve of Eratosthenes, I think it's quite fast for small limits. Any suggestions how to improve it? Especially for small limits, say limits < 50,000,000. (Also coded a parallel sieve (in ...
3
votes
0answers
98 views
Kotlin sieve using sequences
While learning about functional programming the simple sieve example was brought up in Haskell. I wanted to try a Kotlin implementation using sequences.
Are there any other quick wins without ...
8
votes
1answer
879 views
Finding nth Prime using Python and Sieve of Eratosthenes
I'm currently working through the Project Euler Problems using HackerRank to evaluate the code and I'm stuck on the 7th Problem.
...
5
votes
4answers
625 views
Improved RandomGenerator with nextPrime() method
I am trying to implement a method that generates a random prime number between a given range.
I have tried using a simple method to find whether a number is prime or not, advanced simple method, ...
6
votes
1answer
121 views
Python3 - Prime Sieve
I've implemented two prime sieves in python 3 to find all prime numbers up to an upper limit n - n exlusive. The first one is ...
17
votes
5answers
3k views
Sieve of Eratosthenes in C
I have attempted to implement the Sieve of Eratosthenes in C. It works rather quickly with values tested up to ten million: time ./soe.out 10000000 returns ...
7
votes
4answers
446 views
Eratosthenes' and Sundaram's prime sieves in Python
I recently started playing with Python. What can I do better?
...
3
votes
1answer
523 views
Sieve of Eratosthenes using Java 8 streams
I am learning streams and lambdas in Java 8.
I wanted to implement the classic Sieve of Eratosthenes using lambdas and streams. This is my implementation.
...
1
vote
1answer
462 views
Rust nth prime implementation
I have implemented an nth prime algorithm in Rust that uses value lookup for n < 6, trial division for n < 1000, and a sieve function for n > 999. How can it be better optimized?
...
2
votes
2answers
562 views
Space and time efficient Algorithm for generating prime numbers
I have developed an algorithm for generating prime numbers (which turns out to be an optimized version of the Sieve of Eratosthenes) by reducing the space by a factor of 64.
...
6
votes
2answers
4k views
Implementation of Sieve of Eratosthenes in Python
The following is my implementation of Sieve of Eratosthenes. Can somebody please review it? Am I adhering to the algorithm and is it a reasonable implementation of it?
...
4
votes
5answers
126 views
Eratosthenes Sieve Implementation
My friend and I were doing an Eratosthenes Sieve implementation, it works, but I think there is a mistake with "n" and with the first for condition ("i<=n"). I think that condition can cause a ...
5
votes
2answers
243 views
Sieve of Eratosthenes prime number finder up to n in C++
I'be been learning c++ recently and as an exercise I wanted to write a program to find numbers up to n using sieve of Eratosthenes.
I'm new to c++ and programming in general so I'm not sure if this ...
1
vote
1answer
55 views
Basic Sieve of Erosthenes
This is a basic command line program that, given a number, returns a list of primes up to and including that number. Also handles a lack of command line arguments and non-number arguments.
I ran into ...
7
votes
5answers
721 views
“The Genuine Sieve of Eratosthenes” in C++14
The following C++ code implements the "Genuine Sieve of Eratosthenes" algorithm as described in Melissa O'Neill's classic paper. On my MacBook it computes the first 1,000,000 primes in about 11 ...
6
votes
1answer
82 views
Object oriented, runtime expandable Sieve of Eratosthenes
In answering this question, it seemed to me that it would be nice to have a runtime expandable Sieve of Eratosthenes. This is my implementation of that notion.
Design
I've created a class named <...
5
votes
1answer
276 views
Prime Number Generator Time Limit Exceeded
PRIME1- Prime Generator
The code is working fine and it's generating a prime number from M to N but the only problem is I'm getting TLE when I submit my answer. How do I optimise my code to pass the ...
5
votes
1answer
404 views
Prime Sieve in Rust (Sieve of Eratosthenes)
I am learning Rust and I decided to make a prime sieve program. It works and has comparable performance to my equivalent C program.
I am new to Rust so I would like some feedback on my code. In ...
8
votes
1answer
456 views
Prime sieve for all primes up to a number
As a beginner to C++, I wanted to make something using what I was learning, so I did this to learn about arrays. This implements the Sieve of Eratosthenes to find the primes up to a limit.
I didn't ...
8
votes
1answer
250 views
Sieve of Eratosthenes performance; Scala very slow compared to Node.js
I am new to Scala so it might show. I am learning it for one of my classes and have to write a performance benchmark. I have written the Sieve of Eratosthenes in both Node.js and Scala, and my Node.js ...
5
votes
4answers
2k views
Find the nth prime number
It's a long time since I've written a Sieve of Eratosthenes (about 3 decades, I think, in ZX Basic). So I decided to revisit in the light of experience.
Rather than allocating a vector of unknown ...
5
votes
2answers
953 views
Segmented Sieve of Eratosthenes
I implemented this for the Prime Generator problem on SPOJ, but I am only getting 0.01s run-time, and would like to be able to match the run-times of the top submissions, which are all 0.00s.
What ...
4
votes
2answers
963 views
Get nth prime number using sieve of Eratosthenes
I am tasked with being able to find the \$n\$th prime number. I've tried to implement something like the sieve of Eratosthenes in increments of 200. The code works and returns the \$n\$th prime number....
3
votes
2answers
76 views
Number Theory Inhibitor Calculator
I've been working on generating primes and prime products quickly to aid me in my research on prime numbers, their density, etc. The answer to my Large Number Limit Extravaganza question proved to be ...
1
vote
1answer
348 views
Finding numbers divisible by primes in a given range
The problem statement (Codeforces#
385C) is this:
We are given a sequence of \$n\$ numbers, i.e. \$x_i\$ and \$m\$ queries to find how many of these are divisble by primes between two given numbers ...
1
vote
1answer
107 views
Custom Sieve of Eratosthenes
I'm trying to improve my code to find all the prime numbers within a set range as fast as possible, and I am trying to make it even faster. On my github page here, I have some optimization settings ...
