python判断素数程序
什么是质数？ (What is a prime number?)
A prime number is a natural number that is greater than 1 and cannot be formed by multiplying two smaller natural numbers.
质数是大于1的自然数，不能通过将两个较小的自然数相乘而形成。
Given a number num, we have to check whether num is a prime number or not.
给定数字num ，我们必须检查num是否是质数。
Example:
例：
Input:
num = 59
Output:
59 is a prime number
Input:
num = 123
Output:
123 is not a prime number
程序检查Python中的素数 (Program to check prime number in Python)
# Python program to check prime number
# Function to check prime number
def isPrime(n):
return all([(n % j) for j in range(2, int(n/2)+1)]) and n>1
# Main code
num = 59
if isPrime(num):
print(num, "is a prime number")
else:
print(num, "is not a prime number")
num = 7
if isPrime(num):
print(num, "is a prime number")
else:
print(num, "is not a prime number")
num = 123
if isPrime(num):
print(num, "is a prime number")
else:
print(num, "is not a prime number")
Output
输出量
59 is a prime number
7 is a prime number
123 is not a prime number
翻译自: https://www.includehelp.com/python/check-prime-number.aspx
python判断素数程序

python判断素数程序
This program will check whether a given number is Prime or Not, in this program we will divide the number from 2 to square root of that number, if the number is divided by any number in b/w then the number will not be a prime number.
 该程序将检查给定数字是否为质数 ，在此程序中，我们将数字从2除以该数的平方根，如果该数字除以b / w中的任何数字，则该数字将不是质数数。 
We are implementing this program using the concept of classes and objects.
 我们正在使用类和对象的概念来实现该程序。 
Firstly we create the Class with Check name with 1 attributes ('number') and 2 methods, the methods are:
 首先，我们使用Check名称创建具有1个属性( 'number' )和2个方法的Class，这些方法是： 
Constructor Method: This is created using __init__ inbuilt keyword. The constructor method is used to initialize the attributes of the class at the time of object creation.
 构造方法 ：这是使用__init__内置关键字创建的。 构造函数方法用于在创建对象时初始化类的属性。 
Object Method: isPrime() is the object method, for creating object method we have to pass at least one parameter i.e. self keyword at the time of function creation.
 对象方法 ： isPrime()是对象方法，要创建对象方法，我们必须在函数创建时传递至少一个参数，即self关键字。 
Secondly, we have to create an object of this class using a class name with parenthesis then we have to call its method for our output.
 其次，我们必须使用带有括号的类名来创建此类的对象，然后必须为其输出调用其方法。 
Below is the implementation of the program,
 下面是该程序的实现， 
 Python代码检查给定数字是否为质数 (Python code to check whether a given number is prime or not)
# Define a class for Checking prime number
class Check :
    
    # Constructor
    def __init__(self,number) :
        self.num = number
       
    # define a method for checking number is prime or not 
    def isPrime(self) :
        
        for i in range(2, int(num ** (1/2)) + 1) :
            
            # if any number is divisible by i 
            # then number is not prime
            # so return False
            if num % i == 0 :
                return False
        
        # if number is prime then return True
        return True


# Main code 
if __name__ == "__main__" :
    
    # input number
    num = 11
    
    # make an object of Check class
    check_prime = Check(num)
    
    # method calling
    print(check_prime.isPrime())
    
    num = 14
    check_prime = Check(num)
    print(check_prime.isPrime())        

Output
 输出量 
True
False


翻译自: https://www.includehelp.com/python/program-to-check-prime-number-using-object-oriented-approach.aspx
python判断素数程序

python判断素数程序
 什么是质数？ (What is a prime number?)
A prime number is a natural number that is greater than 1 and cannot be formed by multiplying two smaller natural numbers.
 质数是大于1的自然数，不能通过将两个较小的自然数相乘而形成。 
Given a number num, we have to check whether num is a prime number or not.
 给定数字num ，我们必须检查num是否是质数。 
Example:
 例： 
    Input:
    num = 59

    Output:
    59 is a prime number

    Input:
    num = 123

    Output:
    123 is not a prime number

 程序检查Python中的素数 (Program to check prime number in Python)
# Python program to check prime number

# Function to check prime number 
def isPrime(n): 
    return all([(n % j) for j in range(2, int(n/2)+1)]) and n>1
  
# Main code
num = 59
if isPrime(num):
  print(num, "is a prime number")
else:
  print(num, "is not a prime number")  

num = 7
if isPrime(num):
  print(num, "is a prime number")
else:
  print(num, "is not a prime number")  

num = 123
if isPrime(num):
  print(num, "is a prime number")
else:
  print(num, "is not a prime number") 

Output
 输出量 
59 is a prime number
7 is a prime number
123 is not a prime number


翻译自: https://www.includehelp.com/python/check-prime-number.aspx
python判断素数程序

来看这一种判断素数（质数）的函数：
form math import sart
def is_prime(n):
if n==1:
return False
for i in range(2, int(sqrt(n) + 1)):
if n % i == 0:
return False
return True
看起来，这是一种比较优秀的方法了，因为通过sqrt()函数减少了开方级的计算量。
再来看：
def is_prime(number):
if number > 1:
if number == 2:
return True
if number % 2 == 0:
return False
for current in range(3, int(math.sqrt(number) + 1), 2):
if number % current == 0:
return False
return True
return False
咋一看，这一次的代码看起来更多。但是，计算量却又在原来的基础上又几乎减少一半。高明之处就在这一句：if number % 2 == 0:，其实这一句就一部将2以及所有合数因子给排除掉了，所以在这一句range(3, int(math.sqrt(number) + 1), 2)中，直接从3起步，步长为2.在range()函数产生的序列是[3,5,7,9,...],比原来由range(2, int(sqrt(n) + 1))产生的[2,3,4,5,6,...]少了合数的部分。