文件名称:歌德巴赫猜想
介绍说明－－下载内容均来自于网络，请自行研究使用
验证：2000以内的正偶数都能够分解为两个素数之和(即验证歌德巴赫猜想对2000以内的正偶数成立)。
*问题分析与算法设计
为了验证歌德巴赫猜想对2000以内的正偶数都是成立的，要将整数分解为两部分，然后判断出分解出的两个整数是否均为素数。若是，则满足题意；否则重新进行分解和判断。
程序中对判断是否为素数的算法进行了改进，对整数判断“用从2开始到该整数的一半”改为“2开始到该整数的平方根”。原因何在请自行分析。
-certification : 2000 within the can is even divided into two prime numbers, and (that is verified Goldbach conjecture on the 2000 is even within the establishment).* Analysis and design of algorithms in order to verify the Goldbach conjecture 2000 is even within the establishment are, we should integer factorization of two parts, and then determine the decomposition of two integers whether all prime numbers. If so, that will meet Italy; Otherwise, decomposition and re-judged. Procedures to determine whether the prime of algorithms for improvements to the integral judgment "used from the beginning of the two half integral" to "the beginning of the two integral to the square root." Why not invite its own analysis.
*问题分析与算法设计
为了验证歌德巴赫猜想对2000以内的正偶数都是成立的，要将整数分解为两部分，然后判断出分解出的两个整数是否均为素数。若是，则满足题意；否则重新进行分解和判断。
程序中对判断是否为素数的算法进行了改进，对整数判断“用从2开始到该整数的一半”改为“2开始到该整数的平方根”。原因何在请自行分析。
-certification : 2000 within the can is even divided into two prime numbers, and (that is verified Goldbach conjecture on the 2000 is even within the establishment).* Analysis and design of algorithms in order to verify the Goldbach conjecture 2000 is even within the establishment are, we should integer factorization of two parts, and then determine the decomposition of two integers whether all prime numbers. If so, that will meet Italy; Otherwise, decomposition and re-judged. Procedures to determine whether the prime of algorithms for improvements to the integral judgment "used from the beginning of the two half integral" to "the beginning of the two integral to the square root." Why not invite its own analysis.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
歌德巴赫猜想.txt