find prime number

  public static int[] findPrimeNum(){ int tmp[] = new int[(int)(100*(1-1/2f-1/3f+1/6f))]; tmp[0]=2;tmp[1]=3;tmp[2]=5;tmp[3]=7;tmp[4]=11;tmp[5]=13; int tmpindex=5; for(int i=17;i<=100;i+=2){ if(!candiv

>>阅读原文<<