Using the isPrime function above, implement a function that takes in an integer n, and returns the smallest prime number greater than n. Your code should computer in a reasonable time for n ~ 1,000,000,000,000. def nextPrime(n): # Provide a correct implementation for this function return 0

TEST

# Print the first 20 primes k = 0 result = [] expected = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71] for i in range(20): k = nextPrime(k) result.append(k) print "The first 20 primes:\t\t\t", result check(result, expected)