如何用线程又快又好地寻找质数?

package 线程学习pn;/** * * @author SeeClanUkyo * */class MyThread implements Runnable { public static long minPrime; boolean isPrime; int count = 0; public void run() {     while (true) {    try {     Thread.sleep(1000 * 1);     System.out.println(\"-----------------扫描质数中\");    } catch (InterruptedException e) {     e.printStackTrace();    }        synchronized (this) {        isPrime = false;    count = 0;    minPrime++;    if(minPrime>1) {     //如果++后的minPrime     // 质数     for (int i = 2; i <= Math.sqrt(minPrime); i++) {      if (minPrime % i == 0) { //        count++;// 结束后 为0 则为质数       break;      }     }     if (count == 0) {      isPrime = true;     }          if (isPrime) {      System.out.println(Thread.currentThread().getName() + \":  \

可在minPrime++后添加输出现在基数+minPrime.证明这个minPrime在每个进程中都是根据前一个基数增长的.