Question 8

import java.util.Scanner;
class Project08
{
public static boolean isPrime(int n)
{
int i,c=0;
for(i=1;i<=n;i++)
if(n%i==0)
c++;
if(c==2)
return true;
return false;
}
public static int rotate(int n)
{
String s=n+""; //n+null
s=s.charAt(s.length()-1)+s.substring(0,s.length()-1);
int z=Integer.parseInt(s);
return z;
}
public static void main(String[]args)
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a number");
int n=sc.nextInt(),t=n;
do
{
t=rotate(t);
}
while(isPrime(t) && t!=n);
if(t==n && isPrime(n))
System.out.println("Yes Cyclic Prime number");
else
System.out.println("Not Cyclic Prime number");
}
}