楼上那位我贴一下代码(java)
import prime.Prime;
public class Main {
public static void main(String[] args) {
int n = 1;
boolean flage = true;
while(n < 100 && flage)
{
n = n+1;
if(Prime.isPrime(n))
{
for(int i = 2; i < n; i++)
{
int k = 1;
for(int j = 0; j < n; j++)
{
k = (k*i)%n;
}
if(k != i)
{
flage = false;
break;
}
}
System.out.println(n + ":" + flage);
}
}
}
}