Question

PLEASE DO IN C# AND MAKE SURE I CAN COPY CODE INTO VISUAL STUDIO Program 4: 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

using System;
public class Program
{
   public static int[] prime_nos = new int[1000]; //Global array which holds prime numbers
   public static int[] pal_nos = new int[1000]; //Global array which holds palindrome numbers
   public static int compare_arry(int[] prime_array, int[] pal_nos, int c) //Function to compare each element in Prime and Palindrome array and return value if elements are same.
   {
       Console.Write("Palindromic Prime Numbers\n");
       for (int i = 0; i < c; i++)
       {
           if (prime_array[i] == pal_nos[i])
               Console.Write(" " + pal_nos[i]);
       }
       return 0;
   }

   public static int generate_Prime(int c)//Function to genreate the prime numbers upto c numbers here it is 50 as in Main
   {
       int k = 1;
       bool isPrime = true;
       for (int i = 2; i <= 10000; i++)//This loop generate prime numbers upto 100000
       {
           for (int j = 2; j <= 100000; j++)
           {
               if (i != j && i % j == 0)
               {
                   isPrime = false;
                   break;
               }
           }
           if (isPrime)
           {
               if (k > c) //check if the number of prime numbers generated is greater than n which is 50, if so stop generating prime
                   break;
               prime_nos[k - 1] = i; //else assign primne number to prim_nos array
               k++; //increament the prime number count by 1
           }
           isPrime = true;
       }
       return 0;
   }
   public static int isPalindrome(int[] prime_array, int c) //check if element from prime_array is palindrome or not
   {
       //for(int k=0;k<c;k++)
       // Console.Write(" "+prime_array[k]);
       int remainder, temp, reverse = 0, num;
       for (int i = 0; i < c; i++)
       {
           num = prime_array[i];
           temp = num;
           while (num > 0)
           {
               remainder = num % 10;
               reverse = reverse * 10 + remainder;
               num /= 10;
           }
           //Console.Write(" "+ reverse);
           pal_nos[i] = reverse;
           reverse = 0;
           temp = 0;
           remainder = 0;
       }
       compare_arry(prime_array, pal_nos, c); //compare prime_array and palindrom array which is pal_nos to putput palindromic prime
       return 0;
   }
   public static void Main(string[] args) //main program
   {
       int n = 50; //MAX 1000
       generate_Prime(n); //call prime number generation method
       isPalindrome(prime_nos, n); //call methos to check for palindrome and print the palindromic prime by calling compare_arry() internally.
   }
}

Output:

Palindromic Prime Numbers 2 3 57 11 101 131 151 181 191 .Program finished with exit code 0 Press ENTER to exit console.