How to use Python to find all primes in a range

This article mainly explains "how to use Python to find all prime numbers in a certain range." Interested friends may wish to have a look. The method introduced in this paper is simple, fast and practical. Let's let Xiaobian take you to learn "how to use Python to find all prime numbers in a certain range"!

Introduction to prime numbers

Prime numbers are also called prime numbers. A natural number greater than 1 that is not divisible by any other natural number except 1 and itself is called a prime; otherwise it is called a composite number.

Method 1

def primeNUM(min,max): if min==1: print ('') min += 1 for i in range(min, max+1): for j in range(2, i + 1): if i % j == 0: #judge whether i can be divided evenly break #exit for loop if j == i: #if j equals i, i is a prime print(i,end=" ") print ('')primeNUM(1,200)

Method 2

def test(num): list = [] #Defines a list for storing calculated numbers i = num -1 #remove itself while i > 1: #remove 1 https://blog.zeruns.tech if num %i == 0 : #determine whether there is a remainder list.append(i) #add all numbers divisible by i to the list i -= 1 if len(list) == 0 and num != 1: #If the list is empty, it means that it divides print(num,end ='')def primeNUM2(min,max): j = min while j < max: test(j) j += 1 print ('')primeNUM2(1,100)

At this point, I believe everyone has a deeper understanding of "how to use Python to find all prime numbers in a certain range." Let's do it in practice! Here is the website, more related content can enter the relevant channels for inquiry, pay attention to us, continue to learn!