primenumbers 1.1.2

Use to find prime numbers

Using the “primenumbers” module you can:

1. Check if a number is prime or not. By using the isprime() function. The result is returned as either True or False.

SYNTAX: isprime(your_number)

Example: >>> import primenumbers >>> primenumbers.isprime(201) >>>False

2. 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]

3. 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:

1. Significantly Faster processing

2. Removed bug in which ‘1’ is being considered as a prime numbers.

3. 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 [e-mail] .