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
Our Free Plans just got better! | Auth0 Icon
Our Free Plans just got better! | Auth0

With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
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