Program by:
Ravi Sharma
(rvisharma)

Prime-Number-Finder-using-Sieve-of-Eratosthenes
===============================================

Finds Prime Numbers using Sieve of Eratosthenes Algorithm

This Program gives you the prime number upto N Integers,
Sieve of Eratosthenes Algorithm is used to determine the
Prime Number

To find the Prime Number, in the console Shell
call the prime_finder(N) function, prime number will
be given upto N integer.

At first you will be prompted with an input, after that you can call it using
function prime_finder(n)

example call:
>>>prime_finder(10)

#output
[2,3,5,7]

(Int) -> (list)

Project Samples

Project Activity

See All Activity >

Categories

Algorithms

Follow Prime-Number-Finder

Prime-Number-Finder Web Site

Other Useful Business Software
MongoDB Atlas runs apps anywhere Icon
MongoDB Atlas runs apps anywhere

Deploy in 115+ regions with the modern database for every enterprise.

MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Prime-Number-Finder!

Additional Project Details

Programming Language

Python

Related Categories

Python Algorithms

Registered

2013-09-27