素數曬法、素數Rabin測試、快速冪取模

素數篩法，產生num之內的素數表java public static int makePrimes(int primes[], int num) { int i, j, cnt; primes[0] = 2; primes[1] = 3; for(i = 5, cnt = 2; i < num; i += 2) { boolean flag = true; fo

>>阅读原文<<