文件名称:Seeking-twin-prime-numbers
介绍说明－－下载内容均来自于网络，请自行研究使用
所谓孪生素数指的是间隔为2的两个相邻素数，因为它们之间的距离已经近的不能再近了，如同孪生兄弟一样，所以将这一对素数称为孪生素数。
显然，最小的一对孪生素数是（1，3）。我们可以写出3〜 100以内的孪生素数，一共有8对，分别是（3，5），（5，7），（11，13），（17，19），（29，31），（41，43），（59，61）和（71，73）。随着数字的增大，孪生素数的分布也越来越稀疏，人工寻找孪生素数变得非常困难。
本题要解决的问题是：编程求出3〜 1000以内的所有孪生素数。-The so-called twin prime number refers to the two adjacent prime numbers of 2, because the distance between them can not be closer, as the twin brothers, so this pair of prime number known as the twin prime number.
Obviously, the smallest pair of twin prime numbers is (1,3). We can write the number of twin numbers within 3 to 100, a total of 8 pairs, respectively (3,5), (5,7), (11,13), (17,19), (29,31) 41, 43), (59, 61) and (71, 73). With the increase in numbers, the distribution of twin prime numbers is becoming more and more sparse, and it is very difficult to find twin numbers manually.
The problem to be solved in this question is: programming to find all within 3 ~ 1000 twin prime number.
显然，最小的一对孪生素数是（1，3）。我们可以写出3〜 100以内的孪生素数，一共有8对，分别是（3，5），（5，7），（11，13），（17，19），（29，31），（41，43），（59，61）和（71，73）。随着数字的增大，孪生素数的分布也越来越稀疏，人工寻找孪生素数变得非常困难。
本题要解决的问题是：编程求出3〜 1000以内的所有孪生素数。-The so-called twin prime number refers to the two adjacent prime numbers of 2, because the distance between them can not be closer, as the twin brothers, so this pair of prime number known as the twin prime number.
Obviously, the smallest pair of twin prime numbers is (1,3). We can write the number of twin numbers within 3 to 100, a total of 8 pairs, respectively (3,5), (5,7), (11,13), (17,19), (29,31) 41, 43), (59, 61) and (71, 73). With the increase in numbers, the distribution of twin prime numbers is becoming more and more sparse, and it is very difficult to find twin numbers manually.
The problem to be solved in this question is: programming to find all within 3 ~ 1000 twin prime number.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Seeking twin prime numbers.docx