Scala | Sieve of Eratosthenes Last Updated : 26 Aug, 2019 Comments Improve Suggest changes Like Article Like Report Eratosthenes of Cyrene was a Greek mathematician, who discovered an amazing algorithm to find prime numbers. This article performs this algorithm in Scala. Step 1 : Creating an Int Stream Scala 1== def numberStream(n: Int): Stream[Int] = Stream.from(n) println(numberStream(10)) Output of above step is Stream(10, ?). Step 2 : Sieve of Eratosthenes function Scala 1== // Defining Sieve of Eratosthenes def sieve_of_Eratosthenes(stream: Stream[Int]): Stream[Int] = stream.head #:: sieve_of_Eratosthenes( (stream.tail) filter (x => x % stream.head != 0) ) println(sieve_of_Eratosthenes(numberStream(10))) Output of above step is Stream(10, ?). Step 3 : Extracting "N" number of primes Scala 1== val no_of_primes = sieve_of_Eratosthenes(numberStream(2)) // Selecting number of primes println(no_of_primes) (no_of_primes take 7) foreach { println(_) } Output of above step is Stream(2, ?) 2 3 5 7 11 13 17. Below is the complete program Scala 1== def numberStream(n: Int): Stream[Int] = Stream.from(n) println(numberStream(10)) // Defining Sieve of Eratosthenes def sieve_of_Eratosthenes(stream: Stream[Int]): Stream[Int] = stream.head #:: sieve_of_Eratosthenes( (stream.tail) filter (x => x % stream.head!= 0) ) println(sieve_of_Eratosthenes(numberStream(10))) val no_of_primes = sieve_of_Eratosthenes(numberStream(2)) // Selecting number of primes println(no_of_primes) (no_of_primes take 7) foreach { println(_) } Output: Stream(10, ?) Stream(10, ?) Stream(2, ?) 2 3 5 7 11 13 17 Insights from the code Using stream.form(), a stream is created which is generating successive numbers. And this number starts off from the argument. A number stream is given to the "sieve_of_Eratosthenes" method. This method by filtering out the elements, lazily generates the successive elements. Below is the complete working code with explanation: Working: abc() method inserts the debug statement in the filter() method. If an element is not evenly divisible by the head, the stream treats it as a good element. The code prints it and return true. Otherwise the filtered out sequence is printed and finally the stream is returned. Some modification is done in sieve_of_Eratosthenes method so as to use the stream creation - abc() method. Elements are taken out from the recursive stream and is printed. Scala 1== object Sieve extends App { def abc(s: Stream[Int], head: Int) = { val r = s filter { x => { if (x % head != 0) { println() println(s"${x} is not evenly divisible by ${head}") true } else { println() println(s"${x} is evenly divisible by ${head}. So Discard ${x}") false } } } r } def numberStream(g: Int): Stream[Int] = Stream.from(g) def sieve_of_Eratosthenes(stream: Stream[Int]): Stream[Int] = stream.head #:: sieve_of_Eratosthenes( abc(stream.tail, stream.head)) val no_of_primes = sieve_of_Eratosthenes(numberStream(2)) (no_of_primes take 7) foreach { println(_) } } Output : 2 3 is not evenly divisible by 2 3 4 is evenly divisible by 2. So Discard 4 5 is not evenly divisible by 2 5 is not evenly divisible by 3 5 6 is evenly divisible by 2. So Discard 6 7 is not evenly divisible by 2 7 is not evenly divisible by 3 7 is not evenly divisible by 5 7 8 is evenly divisible by 2. So Discard 8 9 is not evenly divisible by 2 9 is evenly divisible by 3. So Discard 9 10 is evenly divisible by 2. So Discard 10 11 is not evenly divisible by 2 11 is not evenly divisible by 3 11 is not evenly divisible by 5 11 is not evenly divisible by 7 11 12 is evenly divisible by 2. So Discard 12 13 is not evenly divisible by 2 13 is not evenly divisible by 3 13 is not evenly divisible by 5 13 is not evenly divisible by 7 13 is not evenly divisible by 11 13 14 is evenly divisible by 2. So Discard 14 15 is not evenly divisible by 2 15 is evenly divisible by 3. So Discard 15 16 is evenly divisible by 2. So Discard 16 17 is not evenly divisible by 2 17 is not evenly divisible by 3 17 is not evenly divisible by 5 17 is not evenly divisible by 7 17 is not evenly divisible by 11 17 is not evenly divisible by 13 17 Comment More infoAdvertise with us Next Article Check if a number is Primorial Prime or not ankita_saini Follow Improve Article Tags : Scala Scala scala-collection Similar Reads Check for Prime Number Given a number n, check whether it is a prime number or not.Note: A prime number is a number greater than 1 that has no positive divisors other than 1 and itself.Input: n = 7Output: trueExplanation: 7 is a prime number because it is greater than 1 and has no divisors other than 1 and itself.Input: n 11 min read Primality Test AlgorithmsIntroduction to Primality Test and School MethodGiven a positive integer, check if the number is prime or not. A prime is a natural number greater than 1 that has no positive divisors other than 1 and itself. Examples of the first few prime numbers are {2, 3, 5, ...}Examples : Input: n = 11Output: trueInput: n = 15Output: falseInput: n = 1Output: 10 min read Fermat Method of Primality TestGiven a number n, check if it is prime or not. We have introduced and discussed the School method for primality testing in Set 1.Introduction to Primality Test and School MethodIn this post, Fermat's method is discussed. This method is a probabilistic method and is based on Fermat's Little Theorem. 10 min read Primality Test | Set 3 (MillerâRabin)Given a number n, check if it is prime or not. We have introduced and discussed School and Fermat methods for primality testing.Primality Test | Set 1 (Introduction and School Method) Primality Test | Set 2 (Fermat Method)In this post, the Miller-Rabin method is discussed. This method is a probabili 15+ min read Solovay-Strassen method of Primality TestWe have already been introduced to primality testing in the previous articles in this series. Introduction to Primality Test and School MethodFermat Method of Primality TestPrimality Test | Set 3 (MillerâRabin)The SolovayâStrassen test is a probabilistic algorithm used to check if a number is prime 13 min read Lucas Primality TestA number p greater than one is prime if and only if the only divisors of p are 1 and p. First few prime numbers are 2, 3, 5, 7, 11, 13, ...The Lucas test is a primality test for a natural number n, it can test primality of any kind of number.It follows from Fermatâs Little Theorem: If p is prime and 12 min read Sieve of Eratosthenes Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number. Examples:Input: n = 10Output: 2 3 5 7Explanation: The prime numbers up to 10 obtained by Sieve of Eratosthenes are 2 3 5 7 .Input: n = 20Output: 2 3 5 7 11 13 17 19Explanation: The prime numbers 6 min read How is the time complexity of Sieve of Eratosthenes is n*log(log(n))? Pre-requisite: Sieve of Eratosthenes What is Sieve of Eratosthenes algorithm? In order to analyze it, let's take a number n and the task is to print the prime numbers less than n. Therefore, by definition of Sieve of Eratosthenes, for every prime number, it has to check the multiples of the prime an 3 min read Sieve of Eratosthenes in 0(n) time complexity The classical Sieve of Eratosthenes algorithm takes O(N log (log N)) time to find all prime numbers less than N. In this article, a modified Sieve is discussed that works in O(N) time.Example : Given a number N, print all prime numbers smaller than N Input : int N = 15 Output : 2 3 5 7 11 13 Input : 12 min read Programs and Problems based on Sieve of EratosthenesC++ Program for Sieve of EratosthenesGiven a number n, print all primes smaller than or equal to n. It is also given that n is a small number. For example, if n is 10, the output should be "2, 3, 5, 7". If n is 20, the output should be "2, 3, 5, 7, 11, 13, 17, 19".CPP// C++ program to print all primes smaller than or equal to // n usin 2 min read Java Program for Sieve of EratosthenesGiven a number n, print all primes smaller than or equal to n. It is also given that n is a small number. For example, if n is 10, the output should be "2, 3, 5, 7". If n is 20, the output should be "2, 3, 5, 7, 11, 13, 17, 19". Java // Java program to print all primes smaller than or equal to // n 2 min read Scala | Sieve of EratosthenesEratosthenes of Cyrene was a Greek mathematician, who discovered an amazing algorithm to find prime numbers. This article performs this algorithm in Scala. Step 1 : Creating an Int Stream Scala 1== def numberStream(n: Int): Stream[Int] = Stream.from(n) println(numberStream(10)) Output of above step 4 min read Check if a number is Primorial Prime or notGiven a positive number N, the task is to check if N is a primorial prime number or not. Print 'YES' if N is a primorial prime number otherwise print 'NO.Primorial Prime: In Mathematics, A Primorial prime is a prime number of the form pn# + 1 or pn# - 1 , where pn# is the primorial of pn i.e the pro 10 min read Sum of all Primes in a given range using Sieve of EratosthenesGiven a range [l, r], the task is to find the sum of all the prime numbers in the given range from l to r both inclusive.Examples: Input : l = 10, r = 20Output : 60Explanation: Prime numbers between [10, 20] are: 11, 13, 17, 19Therefore, sum = 11 + 13 + 17 + 19 = 60Input : l = 15, r = 25Output : 59E 1 min read Prime Factorization using Sieve O(log n) for multiple queriesWe can calculate the prime factorization of a number "n" in O(sqrt(n)) as discussed here. But O(sqrt n) method times out when we need to answer multiple queries regarding prime factorization.In this article, we study an efficient method to calculate the prime factorization using O(n) space and O(log 11 min read Java Program to Implement Sieve of Eratosthenes to Generate Prime Numbers Between Given RangeA number which is divisible by 1 and itself or a number which has factors as 1 and the number itself is called a prime number. The sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n when n is smaller than 10 million or so. Example: Input : from = 1, to = 20 Out 3 min read Segmented Sieve Given a number n, print all primes smaller than n. Input: N = 10Output: 2, 3, 5, 7Explanation : The output â2, 3, 5, 7â for input N = 10 represents the list of the prime numbers less than or equal to 10. Input: N = 5Output: 2, 3, 5 Explanation : The output â2, 3, 5â for input N = 5 represents the li 15+ min read Segmented Sieve (Print Primes in a Range) Given a range [low, high], print all primes in this range? For example, if the given range is [10, 20], then output is 11, 13, 17, 19. A Naive approach is to run a loop from low to high and check each number for primeness. A Better Approach is to precalculate primes up to the maximum limit using Sie 15 min read Longest sub-array of Prime Numbers using Segmented Sieve Given an array arr[] of N integers, the task is to find the longest subarray where all numbers in that subarray are prime. Examples: Input: arr[] = {3, 5, 2, 66, 7, 11, 8} Output: 3 Explanation: Maximum contiguous prime number sequence is {2, 3, 5} Input: arr[] = {1, 2, 11, 32, 8, 9} Output: 2 Expla 13 min read Sieve of Sundaram to print all primes smaller than n Given a number n, print all primes smaller than or equal to n.Examples: Input: n = 10Output: 2, 3, 5, 7Input: n = 20Output: 2, 3, 5, 7, 11, 13, 17, 19We have discussed Sieve of Eratosthenes algorithm for the above task. Below is Sieve of Sundaram algorithm.printPrimes(n)[Prints all prime numbers sma 10 min read Like