Question

2. Write an application that inputs a 3-digits number from the user and checks if all digits are prime numbers. If all digits are prime your program should stop. Use do/while for reading the input and any loop format to test if the number is prime. When checking the prime numbers don't use an if to check numbers from 1 - 9; you need to find an algorithm to check if the number is prime or not. Enter a 3-digit number: 124 4 is not a prime number! Enter a 3-digit number: 642 6 is not a prime number! 4 is not a prime number! Enter a 3-digit number: 352 All Prime! Thank You!

Answer 1

import java.util.Scanner;

public class Primes {

public static void main(String[] args) {

// TODO Auto-generated method stub

int n = 0,temp;

int flag=0, primeflag=1;

do

{

flag=0;

System.out.println("Enter a 3 digit number: "); // Enter the 3 digit number

Scanner sc =new Scanner(System.in);

n=sc.nextInt();

// Getting each digit and checking whether its a prime or not

while(n!=0)

{

primeflag=1;

temp=n%10; // Each digit

//Prime Number logic

for(int i=2;i<=temp-1;i++)

{

if(temp%i==0)

{

primeflag=0;

break;

}

}

if(primeflag==0)

{

System.out.println(temp+" is not a prime number"); // Print if a number is not a prime

}

else

{

flag++; // Increase flag if number is not a prime

}

  

n=n/10;

  

}

  

if(flag==3)

System.out.println("All are prime");

  

}while(flag!=3); // repeat until every digit is prime

System.out.println("\nThank You!");

}

}

Output:

Please upvote if you like the answer