Skip to content

Instantly share code, notes, and snippets.

@geekykant
Created September 24, 2019 17:36
Show Gist options
  • Save geekykant/54b35ff7145eb43a3478f363c6f8c072 to your computer and use it in GitHub Desktop.
Save geekykant/54b35ff7145eb43a3478f363c6f8c072 to your computer and use it in GitHub Desktop.
anss
def get_a(n):
a = next_large_prime(n)
def next_large_prime(num):
while(True):
num+=1
if(is_prime(num)):
return num
def is_prime(num):
for i in range(2,num):
if (num % i) == 0:
return False
else:
return True
num = input()
get_a(num)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment