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
Ship Agents Faster Icon
Ship Agents Faster

Transform your applications and workflows into powerful agentic systems at global scale.

Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
Get Started 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