Question
Check whether the given number is twisted prime.
(A number is called a twisted prime number if it is a prime number and the reverse of this number is also a prime number.)
Share code with your friends
Share on whatsapp
Share on facebook
Share on twitter
Share on telegram
Code
Java
Python
Java
import java.util.Scanner;
public class TwistedPrime
{
/* reverseOfNumber() reverses a number */
public static int reverseOfNumber(int num)
{
int temp=0,reversedInteger=0,remainder=0;
temp=num;
while( temp > 0 )
{
remainder = temp % 10;
reversedInteger = reversedInteger * 10 + remainder;
temp /= 10;
}
return reversedInteger;
}
/* isPrime() checks whether a number is prime number or not */
public static boolean isPrime(int num)
{
boolean flag = true;
if(num>1)
{
for (int j = 2; j <= num / 2; j++)
{
if ((num % j) == 0)
{
flag = false;
break;
}
}
}
else
{
flag=false;
}
return flag;
}
public static void main(String[] args)
{
int number=0,reversedNumber=0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number?");
number = sc.nextInt();
if (isPrime(number)==true)
{
reversedNumber=reverseOfNumber(number);
if(isPrime(reversedNumber)==true)
{
System.out.println(number+" is a Twisted Prime");
}
else
{
System.out.println(number+" is Not a Twisted Prime");
}
}
else
{
System.out.println(number+" is Not a Twisted Prime");
}
}
}
Python
def isPrimeNumber(n):
isPrime=True
if(n>1):
for i in range(2,n):
if(n%i==0):
isPrime=False
break
else:
isPrime = False
return isPrime
def reverseOfNumber(n):
reversedInteger= 0
temp= n
while(temp>0):
remainder=temp%10
reversedInteger=reversedInteger*10+remainder
temp=temp//10
return reversedInteger
number=int(input("Enter a number:"))
reversedNumber=reverseOfNumber(number)
if(isPrimeNumber(number)==True and isPrimeNumber(reversedNumber)==True):
print(number,"is a twisted prime number")
else:
print(number,"is not a twisted prime number")
Coding Store
Sale

ISC QUESTION PAPERS WITH SOLUTION(PROGRAMMING ONLY)
Sale
