Find the nearest Prime by Dingledooper(test)

while 1:
 n=input();x=0
 while 1:
  v=n+x;x=~x+(x<0)
  if pow(2,v-1,v)*pow(13,v-1,v)==1:print v;break

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page