Location:
Search - Goldbach
Search list
Description: Goldbach s conjecture： Goldbach(哥德巴赫)曾经提出了一个这样的猜想： 对于2000 以内的正偶数都能够分解为两个素数之和。 要求： 该题是一个猜想，我们不去证明它，而是通过编程序来验证 该猜想是否正确。 输入： 用户从键盘任意输入一个自然数。 输出： 给出满足猜想的两个自然数。-Goldbach conjecture : Goldbach (Goldbach) had raised such a guess : 2000 within the can is even divided into two prime numbers and. Requirements : The title is a guess, we do not prove it, but through programmed to verify the guess is correct. Input : arbitrary user input from the keyboard to a natural number. Output : meet guess is the natural number two.
Platform: |
Size: 6144 |
Author: 欧 |
Hits:
Description: 问题描述：
哥德巴赫猜想：任何大偶数均可表示为2 个素数之和。-Problem Description: Goldbach conjecture: any large even number can be expressed as two Primes.
Platform: |
Size: 1024 |
Author: fuwei |
Hits:
Description: 哥德巴赫猜想的算法思想以及算法的的具体实现以及试验数据-Goldbach Conjecture
Platform: |
Size: 3072 |
Author: 土豆 |
Hits:
Description: 哥德巴赫猜想，证明任意大的一个偶数都可以表示成为两个素数的和！-Goldbach Conjecture to prove that an arbitrary large even number can be expressed into two prime numbers, and!
Platform: |
Size: 179200 |
Author: 赵帅 |
Hits:
Description: 哥德巴赫猜想:
将一给定的偶数表示成两个质数之和被称之为此数的哥德巴赫分割。例如，
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:
Will give one set even express into a number of both qualitative and has been described as the number of Goldbach partitions. For example,
4 = 2+ 2
6 = 3+ 3
8 = 3+ 5
10 = 3+ 7 = 5+ 5
12 = 5+ 7
14 = 3+ 11 = 7+ 7
...
In other words, the Goldbach conjecture that every even number greater than or equal to 4 are Goldbach few- can be expressed as the number of both qualitative and few. [1] Another odd similarity to the suspect, known as Li guess.
Platform: |
Size: 1024 |
Author: lll |
Hits:
Description: 歌德巴赫猜想验证工具，附质数库以及质数生成器。-Goldbach conjecture verification tools, with the Treasury and the prime number prime number generator.
Platform: |
Size: 3269632 |
Author: 朱凯迪 |
Hits:
Description: 进行哥德巴赫猜想的数据实验，即输入一个比6大的数，输出x=a+b,x为输入，a、b分别为x的两个素数质因数。-The experimental data Goldbach' s conjecture, that is to enter a larger number than 6, the output x = a+ b, x as input, a, b are the two prime x prime factors.
Platform: |
Size: 2048 |
Author: 马志达 |
Hits:
Description: 该题目为哥德巴赫猜想的计算机验证-acm题目-Titled Goldbach Conjecture computer to verify acm-topic
Platform: |
Size: 1024 |
Author: 高岱 |
Hits:
Description: 验证哥德巴赫猜想，利用枚举算法进行验证，每一个不小于6的偶数都等于相应的两个素食之和-Verify the Goldbach conjecture, the enumeration algorithm for authentication, each not less than 6 even equal to two vegetarian and
Platform: |
Size: 186368 |
Author: 汪洋 |
Hits:
Description: 验证歌德巴赫猜想
puts("=== === === === === === === === === === ")
puts("|| This program will verify the Goldbach Guess. ||")
puts("|| That is any positive even number can be broken up into ||")
puts("|| the sum of two prime numbers. ||")
puts("|| e.g., 4=2+2, 6=3+3, 8=3+5, 10=3+7, 12=5+7,... ||")
puts("============================================================") -Verify that the Goldbach conjecture puts
Platform: |
Size: 1024 |
Author: fei |
Hits:
Description: 歌德巴赫猜想,任何一个大于六的偶数可以拆分成两个质数的和
打印出所有的可能
-Goldbach conjecture that any even number greater than six can be split into two prime numbers and print out all possible
Platform: |
Size: 3072 |
Author: 常文静 |
Hits:
Description: 用forran实现哥德巴赫猜想的一种程序-Program to realize goldbach conjecture
Platform: |
Size: 3072 |
Author: 阿敏 |
Hits:
Description: 程序可以验证大整数的哥德巴赫猜想，即任意大于2的偶数可写成两素数之和-Large integer program can verify Goldbach conjecture, that any even number greater than 2 can be written by two primes
Platform: |
Size: 1903616 |
Author: zhangjianw |
Hits:
Description: 有visualBasic写的哥德巴赫猜想-Goldbach Conjecture
Platform: |
Size: 2048 |
Author: lxs |
Hits:
Description: 用sql语言中的函数实现goldbach猜想，在sql server 2008上运行成功-Achieve goldbach guess using sql language function to run successfully on sql server 2008
Platform: |
Size: 5120 |
Author: 杨帆 |
Hits:
Description: 基于MFC的哥德巴赫猜想验证程序,运用c++进行编写-Based on the MFC goldbach conjecture verification procedures.
Platform: |
Size: 329728 |
Author: 熊文韬 |
Hits:
Description: 验证100以内的正偶数都能分解为两个素数之和即验证歌德巴赫猜想对100以内的正偶数成立。-Positive verification within 100 can be broken down into even two prime numbers and verify Goldbach conjecture that the positive even 100 within the establishment.
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 一个用C++写的用来验证哥德巴赫猜想的小程序-One written by C++ used to verify Goldbach conjecture applet
Platform: |
Size: 626688 |
Author: davidlmiller |
Hits:
Description: 用c语言编写的哥德巴赫猜想程序，用于实现结论：任何一个大于4的偶数，都可以被拆解成2个质数之和-The program is used to achieve the conclusion of Goldbach conjecture.
Platform: |
Size: 13312 |
Author: 欣 |
Hits:
Description: 用bitmap哥德巴赫猜想c语言实现 内含五个method(implement goldbach with bitmap)
Platform: |
Size: 1024 |
Author: zhpizza
|
Hits: