GoldbachAn application designed to analyze Goldbach's Conjecture | |
Download |
Goldbach Ranking & Summary
Advertisement
Goldbach Tags
Goldbach Description
Goldbach is a program that investigates Goldbach's Conjecture. Goldbach's Conjecture in Euler's form is: Every even integer 2n >= 4 is the sum of two primes. But for large n there appears to be many decompositions guaranteed. This program computes terms for The On-Line Encyclopedia of Integer Sequences maintained by N. J. A. Sloane. The sequence generates is: A135733 1, 6, 34, 64, 76, 94, 166, 199, 244, 244, 316, 346, 496, 496, 556, 556, 556, 706, 706, 724, 724, 859, 1024, 1024, 1024, 1024, 1126, 1336, 1336, 1468, 1468, 1468, 1489, 1489, 1489, 1546, 1609, 1609, 1636, 1648, 1816, 1877, 1877, 2011, 2029, 2206, 2224,... For every integer m > a(n), 2m can be decomposed into at least n unordered sums of two primes. Goldbach's conjecture is equivalent to the case when n = 1, a(1) = 1, but for large n there appears to be many decompositions guaranteed. This sequence is based on a heuristic calculation and so far there is no evidence that it's correct. Requirements: · .NET Framework 1.1
Goldbach Related Software