This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def find_next_prime(n): | |
# A prime number is a natural number greater than 1 | |
# that has no positive divisors other than 1 and itself. | |
# find the next prime number greater than n by iterating +1 and checking | |
# if the number is prime | |
o = n+1 | |
while check_prime(o) is False: |
NewerOlder