搜索资源列表
验证歌德巴赫猜想
- 验证歌德巴赫猜想（dfoighdafphsdf ）-certification Goldbach conjecture (dfoighdafphsdf)
哥德巴赫
- Goldbach s conjecture： Goldbach(哥德巴赫)曾经提出了一个这样的猜想： 对于2000 以内的正偶数都能够分解为两个素数之和。 要求： 该题是一个猜想，我们不去证明它，而是通过编程序来验证 该猜想是否正确。 输入： 用户从键盘任意输入一个自然数。 输出： 给出满足猜想的两个自然数。-Goldbach conjecture : Goldbach (Goldbach) had raised such a guess : 2000 within the can is eve
2262
- 北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers.
goldbach
- 问题描述： 哥德巴赫猜想：任何大偶数均可表示为2 个素数之和。
EX_2
- C语言验证歌德巴赫猜想-C language test Goldbach conjecture
GoldBach
- 黑洞的算法，和二分法，我写的，嗲给知道一些，自己感觉还可以。
验证歌德巴赫猜想（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.
yanzhenggedebahecaixiang
- 验证歌德巴赫猜想的C语言源代码，对数学验证类编程感兴趣的朋友可以交流一下。-Goldbach conjecture verification C language source code, to verify the type of mathematical programming of interest to friends can exchange.
Goldbach
- 哥德巴赫猜想的算法思想以及算法的的具体实现以及试验数据-Goldbach Conjecture
069
- 验证歌德巴赫猜想（验证2000以内的正偶数都可以分解为两个素数之和）-Goldbach conjecture verification (authentication 2000 is even less than can be decomposed into the sum of 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
Goldbach
- 哥德巴赫猜想: 将一给定的偶数表示成两个质数之和被称之为此数的哥德巴赫分割。例如， 4 = 2 + 2 6 = 3 + 3 8 = 3 + 5 10 = 3 + 7 = 5 + 5 12 = 5 + 7 14 = 3 + 11 = 7 + 7 … 换句话说，哥德巴赫猜想主张每个大于等于 4 的偶数都是哥德巴赫数－可表示成两个质数之和的数。[1]另有对奇数的相似猜想，称之为李维猜想。 -Goldbach s conjecture:
GoldbachConjecture
- 哥德巴赫猜想，数字系统设计答辩资料，获得了一等奖哦！-Goldbach Conjecture, digital system design reply information received first prize Oh!
Goldbach
- 歌德巴赫猜想验证工具，附质数库以及质数生成器。-Goldbach conjecture verification tools, with the Treasury and the prime number prime number generator.
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.
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