public class Prime{
public static boolean isPrime(int value){
int i = (int)Math.floor(Math.sqrt(value));
for(int k = 2; k <= i; k++)
for(int j = value - 1; j >= i; j--){
if( k * j == value)
return false;
}
return true;
}
public static void main(String[] args){
System.out.println(isPrime(47));
}
}
public static boolean isPrime(int value){
int i = (int)Math.floor(Math.sqrt(value));
for(int k = 2; k <= i; k++)
for(int j = value - 1; j >= i; j--){
if( k * j == value)
return false;
}
return true;
}
public static void main(String[] args){
System.out.println(isPrime(47));
}
}
{
public static void main(String[] args)
{
int n = 100;
System.out.println("素数如下:");
boolean isPrime = false;
for (int i=1; i<= n; i++)
{
isPrime = true;
for (int j=2; j<=i/2; j++)
{
if (i%j==0)
{
isPrime = false;
break;
}
}
if(isPrime == true)
{
System.out.println(" " + i);
}
}
}
}