Question

A palindromic prime is a prime number that is also a palindrome (reads the same forwards and backwards). For example, 373 is a palindromic prime. Write a Python program, in a file called palindromic_prime.py, to display the first n primes where the value of n is obtained from the user. Output NUM_PER_LINE palindromic primes per line, where NUM_PER_LINE is assigned to 10 (note format in sample output below).

Your solution should include the following functions:

• isPrime(number) - returns True if number is prime, False otherwise
• isPalindrome(number) - returns True if number is a palindrome, False otherwise
• reverse(number) - returns the reverse of number (i.e., reverse(123) returns 321)

Sample output:

How many palindromic primes should be computed?: 100
    2     3     5     7    11   101   131   151   181   191
  313   353   373   383   727   757   787   797   919   929
10301 10501 10601 11311 11411 12421 12721 12821 13331 13831
13931 14341 14741 15451 15551 16061 16361 16561 16661 17471
17971 18181 18481 19391 19891 19991 30103 30203 30403 30703
30803 31013 31513 32323 32423 33533 34543 34843 35053 35153
35353 35753 36263 36563 37273 37573 38083 38183 38783 39293
70207 70507 70607 71317 71917 72227 72727 73037 73237 73637
74047 74747 75557 76367 76667 77377 77477 77977 78487 78787
78887 79397 79697 79997 90709 91019 93139 93239 93739 94049

A palindromic prime is a prime number that is also a palindrome (reads the same forwards and backwards). For example, 373 is a palindromic prime. Write a Python program, in a file called palindromic prime. py, to display the first n primes where the value of n is obtained from the user. Output NUM PER_LINE palindromic primes per line, where NUM PER_ LINE is assigned to 10 (note format in sample output below) 2 0 Your solution should include the following functions: . İsPrime (number) -returns True if number is prime, False otherwise . İspal índrome(number)-returns True İf number is a palindrome, False otherwise reverse(number)-returns the reverse of number (i.e., reverse(123) returns 321) Sample output: How many palindromic primes should be computed?: 10e 7 11 101 131 151 181 191 313 353 373 383 727 757 787 797 919 929 1θ381 10501 10681 11311 11411 12421 12721 12821 13331 13831 13931 14341 14741 15451 15551 16061 16361 16561 16661 17471 17971 18181 18481 19391 19891 19991 30183 30203 38483 38793 30803 31013 31513 32323 32423 33533 34543 34843 35053 35153 35353 35753 36263 36563 37273 37573 38083 38183 38783 39293 70287 78507 70687 71317 71917 72227 72727 73037 73237 73637 74047 74747 75557 76367 76667 77377 77477 77977 78487 78787 78887 79397 79697 79997 90789 91019 93139 93239 93739 94049

Answer 1

def isPrime(num):

i=2

if(num%2==0 and num!=2):

return False

while(i<num):

if(num%i==0):

return False

i=i+1

return True

def reverse(n):

rev=0

while(n>0):

dig=n%10

rev=rev*10+dig

n=n//10

return rev

def isPalindrome(num):

rev=reverse(num)

#print("rev ",rev,"num",num)

return rev==num

count=int(input("How many palindromic primes should be computed : "))

i=0

index=1

while(i<count):

if(isPrime(index) and isPalindrome(index)):

print(index,end=" ")

if(i%10==0):

print()

i=i+1

index=index+1

defisP rine(num): [GCC 4.8.2] on 1inux How any palindronic primes shauld ke computed 1 100 if(num%2"#8 and num!#2) 2 35 7 11 101 131 151 181 191 313 353 373 383 727 757 787 797 919 929 10301 10501 10601 11311 11411 12421 12721 12821 13331 13831 13931 14341 14741 15451 15551 16061 16361 16561 16661 17471 17971 18181 18481 19391 19891 19991 30103 30203 30403 30703 30803 31013 31513 32323 32423 33533 34543 34843 35053 35153 35353 35753 36263 36563 37273 37573 38083 38183 38783 39293 return False while(icnum): if (numki--): return False i-i+1 9 return True 11 def reverse(n): rev-e 13 while(n>e): 14 15 16 17 digan%18 reverev 1e+dig n-n/1e 18 return rev isPalindrome (num): rev-reverse(num) 21 27 -0 28 index-1 29 while(icount): 30 if(isPrime(index) 31 32 and isPalindrone(index print(index,end-"" print() 34 35 36 i-it1 index-indext1