mirror of
https://hub.njuu.cf/TheAlgorithms/Python.git
synced 2023-10-11 13:06:12 +08:00
75d11f9034
As the for-loop was looping by two numbers, it would stop at 1 number less than the root of prime squares, resulting it in incorrectly classifying the squares as prime numbers. Incrementing the loop ensures the next number is also considered resulting in accurate classification.
18 lines
347 B
Python
18 lines
347 B
Python
def primeCheck(number):
|
|
prime = True
|
|
for i in range(2, int(number**(0.5)+2), 2):
|
|
if i != 2:
|
|
i = i - 1
|
|
if number % i == 0:
|
|
prime = False
|
|
break
|
|
return prime
|
|
|
|
def main():
|
|
print(primeCheck(37))
|
|
print(primeCheck(100))
|
|
print(primeCheck(77))
|
|
|
|
if __name__ == '__main__':
|
|
main()
|