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
$300 Free Credits for Your Google Cloud Projects
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Prime-Number-Finder!