Best Answer

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.");

}

}

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

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

A prime number can only be divided by itself and 1

Find a prime number, add 2 to the number. Check if the new number is prime. IE : 3 is prime. 3+2 =5. 5 is prime. (3,5) are twin primes.

13

#include<stdio.h> main() { int check, i, x,y,m; printf("enter the number upto which check"); scanf("%d",&check); y=1; for(m=2; m<=check; m++) { for(x=2;x<m; x++) { y=m%x; if(y==0) break; } if(y!=0) printf("%d is prime number\n",m); else printf("%d is not a prime number\n",m); } getch(); }

Prime numbers are numbers that are only divisible by themselves and the number 1. You can write a program to print all prime numbers from 1 to 100 in FoxPro.

Related questions

No, it is not. You can check on prime-numbers.org

First write a program to generate the prime number. After one prime number was generated, divide the big int number by the prime number. If the remainder is zero then quotient is the second prime number ( also it is important to check whether the quotient is prime number or not because sometimes you will get wrong answer). Repeat the process until you get the result.

No its not a prime number Check out related links

#include<iostream.h> #include<conio.h> int main() { int i,n; clrscr(); cout<<"PROGRAM TO CHECK IF THE NUMBER IS PRIME OR NOT:"<<endl; cout<<"Enter a number:"; cin>>n; for(int i=2;i<n;i++) { if(n%i==0) cout<<"\nTHE NUMBER IS COMPOSITE"<<endl; else cout<<"\nTHE NUMBER IS PRIME"<<endl; } return 0; }

A prime number can only be divided by itself and 1

Use Wolfram|Alpha... go to the related link below, Wolfram|Alpha, and type in (is __ (number) prime) and then the program will compute that and tell you if it is prime or composite.

Find a prime number, add 2 to the number. Check if the new number is prime. IE : 3 is prime. 3+2 =5. 5 is prime. (3,5) are twin primes.

13

the largest prime number under 100 is 97

#include<stdio.h> main() { int check, i, x,y,m; printf("enter the number upto which check"); scanf("%d",&check); y=1; for(m=2; m<=check; m++) { for(x=2;x<m; x++) { y=m%x; if(y==0) break; } if(y!=0) printf("%d is prime number\n",m); else printf("%d is not a prime number\n",m); } getch(); }

Prime numbers are numbers that are only divisible by themselves and the number 1. You can write a program to print all prime numbers from 1 to 100 in FoxPro.

#include<iostream.h> #include<conio.h> void prime(int n) { clrscr(); int num; cout<<"enter the numbers"<<endl; cin>>num; prime(num); getch(); } void prime(int n) { int prime=1,i; for(i=2;i<=n/2;i++) if(n%i==1) prime=0; if(prime==1) cout<<"the number"<<n>>"is prime"; else cout<<"the number"<<n<<"is not prime"; }