Two Methods for python to Judge Whether an Input Positive Integer Is a Prime Number

A prime number (also called a prime number) is a positive integer that cannot be divisible by any positive integer except 1 and the number itself. To judge whether a positive integer m is a prime number, it is only necessary to judge whether m can be divisible by any one positive integer in the 2 ~ root sign m. If m cannot be divisible by any one positive integer in this range, m is a prime number, otherwise m is a composite number.

Method 1: (Using for loop and break statement)

import math
m = int(input(" Please enter 1 Integer (>1) : "))
k = int(math.sqrt(m))
for i in range(2, k+2):
  if m % i == 0:
    break # It can be divisible, it is definitely not a prime number, and it ends the loop 
if i == k+1: print(m, " Is a prime number! ")
else: print(m, " It's a composite number! ")

Method 2: (Using while loop and bool variable)

import math
m = int(input(" Please enter 1 Integer (>1) : "))
k = int(math.sqrt(m))
flag = True # Assume that the integer entered is a prime number 
i = 2
while (i <= k and flag == True):
  if (m % i == 0): flag = False # It can be divisible, it is definitely not a prime number, and it ends the loop 
  else: i += 1
if (flag == True): print(m, " Is a prime number! ")
else: print(m, " It's a composite number! ")

Example: Print all prime numbers between 100 and 200, and output 10 primes per line

import math;n=0
for m in range(101,201,2):
  k = int(math.sqrt(m))
  for i in range(2,k+2):
    if m % i == 0:break
  if i == k+1:
    if n % 10 == 0:print()
    print('%d' % m,end=' ')
    n += 1