PROGRAM TO CHECK THE GIVEN NUM IS PRIME .IF ITS PRIME CHECK THE SUM OF ITS DIGITS ALSO A PRIME OR NOT

 PROGRAM TO CHECK THE GIVEN NUM IS PRIME .IF ITS PRIME CHECK THE SUM OF ITS DIGITS ALSO A PRIME OR NOT


I/P:

13

O/P:

Not a prime num


I/P:

43


O/P:

43


PROGRAM:

import java.util.*;
public class primeCheck {

    public static  boolean isPrime(int iNum)
    {
        int flag=0;
      for(int i=2;i<=iNum/2;i++)
      {
          if(iNum%i==0)
          {
              flag=1;
              break;
          }
      }
      if(flag==0)
      {
          return true;
      }
      return false;
    }
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int iNum=sc.nextInt();
        if(isPrime(iNum))
        {
           int sum=0;
           int t=iNum;
           while(iNum>0)
           {
              int b=iNum%10;
              sum+=b;
              iNum/=10;
           }
           if(isPrime(sum))
           {
               System.out.println(t);
           }
           else{
               System.out.println("Not a prime num");
           }
        }
        else{
            System.out.println("Not a prime num");
        }
    }
}

//Write a program to find a given number is prime or not ,
//If it is prime then find the sum of the primenumber digits also a prime number or not

// 13
// 13 is a prime num 1+3=4 is not a prime num so o/p is
// Not a prime num

// 43
// 43 is prime num 4+3=7 is  prime num ,so op 43 will be printed
// 43

Comments

Post a Comment

Popular posts from this blog

PROGRAM TO FIND FACTORIAL OF A NUMBER USING RECURSION

 PROGRAM TO FIND FACTORIAL OF A NUMBER  USING RECURSION  I/P: 3 O/P: 6 SOLUTION: package   N umbers ; import   java . util .*; public   class   Factorial  {      static   int   factorial ( int   n ) {          return  ( n  >  1 )  ?   n  *  factorial ( n - 1 )  :   1 ;        }         public   static   void   main ( String []  args ) {              Scanner   sc = new   Scanner ( System . in );             int   n  =  sc . nextInt ();                          int   result  ...
Read more

PROGRAM TO FIND THE COUNT OF PARTICULAR NUMBER IN AN ARRAY

  PROGRAM TO FIND THE COUNT OF PARTICULAR NUMBER IN AN ARRAY I/P: 5 1 0 2 0 0 O/P: 3 This program explains how many zeros present in the zero PROGRAM: import   java . util .*; public   class   ZeroCount  {      public   static   void   main ( String   args [])     {          Scanner   sc = new   Scanner ( System . in );          int   iNum = sc . nextInt ();          int   arr []= new   int [ iNum ];          for ( int   i = 0 ; i < iNum ; i ++)         {              arr [ i ]= sc . nextInt ();         }          int   count = 0 ; ...
Read more

TELEPHONE BOOK USING HASHMAP

  Sample Input 3 sam 99912222 tom 11122222 harry 12299933 sam edward harry Sample Output sam=99912222 Not found harry=12299933 Explanation We add the following    (Key,Value)  pairs to our map so it looks like this: We then process each query and print  key=value  if the queried   is found in the map; otherwise, we print  Not found . Query 0:   sam Sam is one of the keys in our dictionary, so we print  sam=99912222 . Query 1:   edward Edward is not one of the keys in our dictionary, so we print  Not found . Query 2:   harry Harry is one of the keys in our dictionary, so we print  harry=12299933 . SOLUTION: package   H acker R ank_problems . practice_problems ; import   java . util .*; import   java . io .*; public   class   TelephoneBook {      public   static   void   main ( String  [] argh ){          Scanne...
Read more