文件名称:Rei07
介绍说明--下载内容均来自于网络,请自行研究使用
求質數法
判斷n是否為質數 時,將n除以n以下的整數直至2為止,以觀察n能
除盡,這時如有被除盡的數,便被視為非質數而脫離出回圈。到了最後如無除盡的數,則此數即為質數。-Seeking qualitative method to determine whether the prime number n to determine whether the prime number n will be n divided by n integers until 2 the following date, in order to observe the n can be divisible, then if there were a number divisible, it is considered non-prime number and out of the loop. At the end of a few such as non-divisible, then the number is prime number.
判斷n是否為質數 時,將n除以n以下的整數直至2為止,以觀察n能
除盡,這時如有被除盡的數,便被視為非質數而脫離出回圈。到了最後如無除盡的數,則此數即為質數。-Seeking qualitative method to determine whether the prime number n to determine whether the prime number n will be n divided by n integers until 2 the following date, in order to observe the n can be divisible, then if there were a number divisible, it is considered non-prime number and out of the loop. At the end of a few such as non-divisible, then the number is prime number.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
1-7厄拉多塞篩的求質數法.doc
Rei07.cpp
Rei07.cpp