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)
Categories
AlgorithmsOther Useful Business Software
Ship Agents Faster
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.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Prime-Number-Finder!