Question

(9) Java program to accept a number and count how many digits of the number are prime using recursion​

Answer 1

Java Program to Find if a Number is Prime or Not using Recursion

public class Prime.

int n, x;

Scanner s = new Scanner(System.

System. out. print("Enter any number:");

n = s. nextInt();

Prime obj = new Prime();

x = obj. prime(n, 2);

if(x == 1)

i hope u fet the answer plz mark me brainliest