搜索资源列表
验证歌德巴赫猜想（2000以内）
- 这是一个验证歌德巴赫猜想对2000以内的正偶数成立的小程序-This is a test Goldbach conjecture right now within the 2000 establishment of even small programs
puzzle_gedebahe
- 验证哥德巴赫猜想，通过VC++程序验证有限个数内哥德巴赫猜想成立-Goldbach conjecture verification through VC++ Procedures to verify within a limited number of the establishment of Goldbach Conjecture
0067
- 采用DELPHI实现哥德巴赫猜想，大于等于4的数写成两个素数的和。-DELPHI used to achieve Goldbach conjecture, greater than or equal to 4 several languages and the two prime numbers.
083
- 歌德巴赫猜想：验证2000以内的正偶数都能够分解成两个素数之和，即验证歌德巴赫猜想再2000范围内的正确性-Goldbach conjecture: Verify 2000 is even less able to break down into two prime numbers and that the Goldbach conjecture and then verify that the scope of the correctness of 2000
A0_005
- 验证哥德巴赫才:任何一个充分大的偶数N(≥4),可以用两个素数之和表示. 如 4=2+2 6=3+3 8=3+5 98=17+79-Verify Goldbach before: Any one sufficiently large even number N (≥ 4), can be expressed the sum of two primes. Such as 4 = 2+2 6 = 3+3 8 = 3+5 98 = 17+79
gedebahecaixiang
- 这段代码是算法设计和ACM程序设计里的一道哥德巴赫猜想的源代码。-This code is ACM algorithm design and program design inside the source code for a Goldbach' s conjecture.
gedecaixiang
- “歌德巴赫猜想”指出，每个大于6的偶数，都可以表示为两个素数之和。试用程序将6~100内的所有偶数表示为两个素数的和-" Goldbach conjecture" that every even number greater than 6, can be expressed as the sum of two primes. Trial procedure within the 6 to 100 all even said the two prime numbers and
Goldbach_Conjecture
- 一个将偶数分解为两个质数的程序，源自于哥德巴赫猜想。-An even number of decomposition procedures for the two prime numbers, derived from the Goldbach Conjecture.
Goldbach-conjecture
- 该题目为哥德巴赫猜想的计算机验证-acm题目-Titled Goldbach Conjecture computer to verify acm-topic
Verify-the-Goldbach-Conjecture
- 验证哥德巴赫猜想，利用枚举算法进行验证，每一个不小于6的偶数都等于相应的两个素食之和-Verify the Goldbach conjecture, the enumeration algorithm for authentication, each not less than 6 even equal to two vegetarian and