Question

USING C# AND PSUDOCODE PLEASE : A palindromic prime number is a number that is both prime number and a palindrome number. For example, 131, 313, and 757 are palindromic prime numbers. Design (pseudocode) and implement (source code) a program (name it PalindromicPrime) to display the first 50 palindromic prime numbers, 10 per line separated by one space. The program defines the following methods: Method isPalindome() to check if a number is palindrome or not. Method isPrime() to check if a number is prime or not. In the main method, use a loop structure to invokes these methods and print out the palindromic primes. Document your code and properly format the outputs as shown below. Output format (each x is a palindromic prime number): x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x Hint: Use modulus and division by 10 to reverse the number

Answer 1

Sourcecode :

import java.io.*;
import java.util.*;
class PrimeAndPalindrome
{
public static void main(String[] args)
{
int c=0;
int value=1;
int count=1;
do
{
//System.out.print("ENtered do loop ");
if(isPrime(value)&&isPalindrome(value))
{
System.out.print(value+" ");
c++;
if(c%10==0)
{
System.out.println();
}
}
value++;
}while(c<50);
}
public static boolean isPrime(int n)
{
int i,m=0,flag=0;
m=n/2;
if(n==0||n==1)
{
return false;
}
else
{
for(i=2;i<=m;i++)
{
if(n%i==0)
{
flag=1;
break;
}
}
if(flag==0)
{
return true;
}
}
return false;
}
public static boolean isPalindrome(int n)
{
int r,sum=0,temp;
temp=n;
while(n>0)
{
r=n%10;
sum=(sum*10)+r;
n=n/10;
}
if(temp==sum)
{
return true;
}
else
{
return false;
}
}
}

output -

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 3070