java program to find prime number

I used C ++ I wrote a code to determine whether a prime number is a prime number, but today I use JAVA it takes a lot of time. I have to admit myself JAVA too much water, you need to study hard in

1 ImportJava.util.Scanner;2 3 /**4 * @authorSchrödinger's Cat5 * Java Determines if a number is prime6 * 7 * Primes, also known as prime numbers, refers to the number of natural numbers greater than 1 that cannot be divisible by other natural numbers except 1 and itself .*/8 Public classPrimenumber {9 Public St

The program prompts the user to enter a number, and then checks whether the number entered is prime.ImportJava.util.Scanner;classprimecheck{ Public Static voidMain (String args[]) {inttemp; BooleanIsprime=true; Scanner Scan=NewScanner (system.in); System.out.println ("Enter a number for check:"); //capture the input in

primes (prime number)Also known as Prime number, refers to the number of natural numbers greater than 1 , except 1 and the number itself, can not be divisible by other natural numbers (can also be defined as only 1 and the

Import java.util.*;public static void Main (string[] args) {Scanner sc=new Scanner (system.in); System.out.println ("Please enter an integer greater than 0 M");//prime number is the remainder is 1 and its own positive integer int m=sc.nextint (); if (m==2| | M==1) {System.out.println ("you entered a prime number");} Ex

Title: Determine the number of primes between 101-200 and the output of all primes.Idea: The method of judging primes: to remove 2 to sqrt (this number) with a number, if divisible, indicates that the number is not a prime, and vice versa is a

1 packagetest;2 3 Importjava.util.Scanner;4 5 //determine if the number of inputs is prime6 public classTest18 {7 public Static voidmain (string[] Args) {8Scanner s =NewScanner (system.in);9System.out.println ("number of inputs judged");Ten intA =S.nextint (); one for(inti=2; I//the smallest prime is 2. a if(a% i = = 0 i! = A)

It's nothing in itself, a bunch of codeIt's a tribute to the next.Had just learned Java, write a prime number within the output 100For me this has the code to run the performance neat person (but itself does not understand the algorithm), cannot tolerateSo I read some information.Reference:http://blog.csdn.net/program_think/article/details/7032600Own Cottage A(No

Prime: A natural number that is greater than 1 and that can only be divisible by 1 and itself is called Prime. We think that the computer determines whether a number is a prime process: for example 11 i=2 2*3 2*3 2*5 I=3 3*2 3*3 I=4 4*2 I=5 5*2 I=6 (over 11 in size

Calculates the smallest prime that is greater than one number, based on the input number. Words are not much to say, direct paste code. Package com.fuxuemingzhu.countprime.main; Import Java.util.Scanner; /** * Attach a screenshot of the operation.

Package com.day3.one;public class PrimeNumber1 {/*** @param args* Print a prime number between 101-200 and count, and one line per 5 output*/public static void Main (string[] args) {int count=0;for (int m=101;m{Boolean a=true;for (int i=2;i{if (m%i==0){A=false;Break}}if (a==true){System.out.print (m+ "");count++;}if (count%5==0)System.out.println ();}System.out.println (' \ n ' + ' total ' +count+ '

Title: Determine the number of primes between 101-200 and the output of all primes.Program Analysis: The method of judging primes: to remove 2 to sqrt (this number) with a number, if divisible, indicates that the number is not a prime, and vice versa is a prime.public class

public class math{public static void Main (string[] args) {int []a =getprimes (1);System.out.println (Arrays.tostring (a));}public static int[] Getprimes (int maxValue) {if (maxvalue>=2) {int s=maxvalue+1;Boolean B=new Boolean (s);}for (int i=0;iB[i]=true;}B[0]=b[1]=false;for (int i=2;ifor (int j=2*i;jF[j]=false;}}int cout=0;for (int i=0;iif (B[i]) {cout++;}}Int[] Primes=new int[cout];for (int i=0;j=0;iPrimes[j++]=i;}}return primes;}else{return new int[0];}J