fork download
copy 
  1. # Prime Palindromes
  2. def isPrime(n):
  3. 	if n <= 3:
  4. 		return n > 1
  5. 	elif n % 2 == 0 or n % 3 == 0:
  6. 		return False
  7. 	i = 5
  8. 	while (i**2 <= n):
  9. 		print(i)
  10. 		if(n % i == 0 or n % (i+2) == 0):
  11. 			return False
  12. 		i += 6
  13. 	return True
  14.  
  15. def isPalindrome(n):
  16. 	n = str(n)
  17. 	for i in range(len(n)):
  18. 		if(not (n[i] == n[len(n)-1-i])):
  19. 			return False
  20. 	return True
  21.  
  22. def palindromeGenerator(x):
  23. 	if x % 2 == 0:
  24. 		x += 1
  25. 		if isPalindrome(x):
  26. 			if isPrime(x):
  27. 				return x
  28. 	while True:
  29. 		x += 2
  30. 		if isPalindrome(x):
  31. 			if isPrime(x):
  32. 				return x
  33.  
  34.  
  35.  
  36. x = int(raw_input())
  37. print(palindromeGenerator(x))
Success #stdin #stdout 0.01s 7152KB
comments (?)
stdin
copy 
798
stdout
copy 
5
11
17
23
29
919
https://ideone.com/woaMmu
language:
Python (cpython 2.7.16)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!