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
AI-generated apps that pass security review Icon
AI-generated apps that pass security review

Stop waiting on engineering. Build production-ready internal tools with AI—on your company data, in your cloud.

Retool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
Try Retool 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