dkarbayev/prime_palindrome.py

Last active February 10, 2018 03:46

Star (0) You must be signed in to star a gist
Fork (0) You must be signed in to fork a gist

Select an option

Learn more about clone URLs
Clone this repository at <script src="https://gist.github.com/dkarbayev/c34171fa41fd138ed1b3.js"></script>
Save dkarbayev/c34171fa41fd138ed1b3 to your computer and use it in GitHub Desktop.

Download ZIP

Find smallest prime palindrome that is larger than n

Raw

prime_palindrome.py

	def g(n):
	n+=1
	while`n`[::-1]!=`n`or any(n%j<1 for j in range(2,n)):n+=1
	return n

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment