primes.py

def powers(num):
    if num > 1:
        for i in range(2,num):
            if (num % i) == 0:
                #print(num,"is not a prime number")
                #print(i,"times",num//i,"is",num)
                return(powers(num+1))
                
        else:
            print(str(num) + " is a prime number")
            return(num)
    
    else:
        print(num,"is <= 1, not a prime number")
        return(powers(num+1))
greatestprime = -1
while True:     
    greatestprime = powers(greatestprime + 1)