Libraries in python to check if a number is prime

0

Is there a library to determine whether the number is prime or the only way is to create the program and run it normally?

    
asked by anonymous 23.12.2017 / 22:10

2 answers

3

You can use libraries, but I really do not see a need to install an additional library for something "simple" and rarely will be used for anything serious. >

Then the only library you'll need is the native math library and a loop ( while for example) library and a calculation will achieve the result, be a simple script like this:

import math

def isPrime(n):
    start = 2;

    while start <= math.sqrt(n):
        if n % start < 1:
            return False;
        start += 1;

    return n > 1;


print(isPrime(12));
print(isPrime(13));

Based on Prime Numbers JavaScript

It's important that you will not get a good performance when the number is great, nor write "the best script everyone will get."

Here is an example with prime numbers up to 997, all should return True :

import math

def isPrime(n):
    start = 2;

    while start <= math.sqrt(n):
        if n % start < 1:
            return False;
        start += 1;

    return n > 1;


primos = [ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,
           53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107,
          109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167,
          173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
          233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283,
          293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359,
          367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431,
          433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491,
          499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571,
          577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641,
          643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709,
          719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787,
          797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859,
          863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941,
          947, 953, 967, 971, 977, 983, 991, 997]

for numero in primos:
    print(isPrime(numero))

Example online at repl.it

    
23.12.2017 / 23:09
1

Yes it does. There is a python library where developers place useful libraries for the developer, including for prime numbers.

Libraries Involving Prime Numbers

    
23.12.2017 / 23:00