pascal programming--prime

只要check下1至target 有幾多個factors..如果得2個factors(1同埋target自己)咁個個數就係prime。

而找prime factor就應該係(1-target內)一個個prime no. generate出黎再試下可唔可以整除到佢。

array p[ ]

for (i = 1 to n) check each number, N
{
if N is prime (N mod p[m] != 0, m = 1, 2, 3, ..., m)
add prime to p[m+1]
}

2007-11-28 21:32:23 補充：
找出 prime factorsfirst, generate p[ ] using above methodthen,for (1 to m) {if N mod p[m] = 0, m = 1, 2, 3, ..., m)output p[m]}