How do you write a java program to check a number is twisted prime or not?

Answer 1

To write a Java program to check if a number is a twisted prime or not, you first need to create a function that checks if the number is prime. You can do this by iterating from 2 to the square root of the number and checking if the number is divisible by any of these values. Once you have verified that the number is prime, you can then check if the number remains prime after twisting its digits (reversing the number and checking if the reversed number is also prime). If both conditions are met, then the number is a twisted prime.

Answer 2

Well, honey, to check if a number is a twisted prime in Java, you first need to create a function to check if the number is prime. Then, you twist the number by reversing its digits and check if the twisted number is also prime. If both the original and twisted numbers are prime, congratulations, you've got yourself a twisted prime! Just remember, Java won't do the work for you - you gotta put in the effort.

Answer 3

public class TwistedPrime

{

public static void main(int n)//Enter a number

{

int num,s=0,c=0,d;

num=n;

while(n>0)

{

d=n%10;

s=s*10+d;

n=n/10;

{

for(int i=1;i<s;i++)

{

if(s%i==0)

c++;

}

}

}

if(c==1)

System.out.print("Number is Twisted Prime");

else

System.out.print("Number is not T.P.");

}

}