论文部分内容阅读
2、质数通项公式的探索。 大家知道,正整数是由1、素 数(质数)与合数这三部分组成 的。一个大于1的正整数,如果只 能被1和它本身整除,而不能被其他正整数整除,那么这样的正整数叫质数。怎样找质数,自古以来是数学中的重要课题。最古老的方法是筛法,即在1,2,3,4,5,……中,去掉1与合数,所得的数2,3,5,7.11,13,17……就是质数表。那么质数有多少个呢?这是一个古老的数学问题,欧几里得用反证法巧妙地证明了质数有无很多个。
2, explore the formula of general term. We all know that the positive integer is composed of 1, prime (prime) and composite of these three parts. A positive integer greater than 1, which can only be divisible by 1 and itself, can not be divisible by other positive integers, then such positive integers are called prime numbers. How to find prime numbers has been an important subject in mathematics since ancient times. The oldest method is the sieve method, ie in 1, 2, 3, 4, 5, ..., remove the 1 and the composite number, the resulting number 2,3,5,7.11,13,17 ... ... is the prime number table. So how many prime numbers? This is an ancient math problem, Euclidean use of anti-card lawfully cleverly proved the existence of a large number of prime numbers.