寻找素数时如何限制我的除数

Question

number = int(input("Enter a number: "))
prime = True

if number <= 1:
    prime = False
    divisor = 1

divisor = 2
while divisor < number and prime == True:
    if divisor == number:
        break

while divisor < number and prime == True:
    if (number > 1) % divisor == 0:
        prime = False
    elif number % divisor !=0:
        prime = True
        divisor = divisor + 1

if number == 1:
    divisor = divisor - 1
        
        
if prime == True:
    print(f"{number} is prime.")
elif prime == False:
    print(f"{number} is not prime.")
    print(f"{number} is divisible by {divisor}")

I am trying to write code to determine whether the input number is a prime number or not (not including 1). It works when I put in numbers like 8, but if I put in a number like 27, the while loop goes on forever and I don't know how to fix it.

Answer 1

Use a debugger like 'python tutor' or 'thonny'. Your problem is on line 9, you have to have a way to escape the loop otherwise it goes forever because 2 is smaller than 27 and the if statement never goes to be true. You don't set any increaser/decreaser.