Java – Print Prime Numbers in the Array

Java – Print only prime numbers in the given array

class Code {             public static void main(String[] args)             {                         int[] arr = {6, 3, 9, 1, 2, 8, 4, 5};                         for (int i=0 ; i<arr.length ; i++){                                     int n = arr[i];                                     int count=0;                                     for (int j=1 ; j<=n ; j++)                                     {                                                 if(n%j==0)                                                             count++;                                     }                                     if(count==2)                                                 System.out.println(n + ” is prime”);                         }             } }

Java – Print multiplication tables of each number in the array

class Code {             public static void main(String[] args)             {                         int[] arr = {6, 3, 9, 1, 2, 8, 4, 5};                         for (int i=0 ; i<arr.length ; i++)                         {                                     int n = arr[i];                                     System.out.println(“Table – ” + n);                                     for (int j=1 ; j<=10 ; j++)                                     {                                                 System.out.println(n + ” x ” + j + ” = ” + (n*j));                                     }                         }             } }

Program to print only perfect numbers in the given array

class Code {             public static void main(String[] args) {                         int[] arr = {6, 3, 9, 1, 2, 8, 4, 5};                         for (int i=0 ; i<arr.length ; i++)                         {                                     int n = arr[i];                                     int sum=0;                                     for (int j=1 ; j<n ; j++)                                     {                                                 if(n%j==0)                                                             sum=sum+j;                                     }                                     if(n==sum)                                                 System.out.println(n + ” is perfect”);                         }             } }