Use to find prime numbers
Using the “primenumbers” module you can:
- Check if a number is prime or not. By using the isprime() function. The result is returned as either True or False.
Example: >>> import primenumbers >>> primenumbers.isprime(201) >>>False
- You can get a list of prime numbers within a specified limit, by using the all_PrimeNumbers_within() function. The result is returned as a list of prime numbers.
SYNTAX: all_PrimeNumbers_within(a_number) #(from 2)
Example: >>> import primenumbers >>> primenumbers.all_PrimeNumbers_within(25) >>>[2, 3, 5, 7, 11, 13, 17, 19, 23]
- You can use the function all_PrimeNumbers_inRange() to find prime numbers within a given range. The result is returned as a list of prime numbers.(Only available in package version 1.1.0 or later)
SYNTAX: all_PrimeNumbers_inRange(start_number, end_number)
Example: >>> import primenumbers >>> primenumbers.all_PrimeNumbers_inRange(25, 60) >>>[29, 31, 37, 41, 43, 47, 53, 59]
What New in Version: 1.1.2:
- Significantly Faster processing
- Removed bug in which ‘1’ is being considered as a prime numbers.
- Removed bug in which negative numbers are being considered as a prime numbers.
Keep an eye for new releases. Thank You. Feel free to mail me for improvements and suggestions at email@example.com .
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size primenumbers-1.1.2.zip (1.0 kB)||File type Source||Python version None||Upload date||Hashes View|