Goldbach's Conjecture
Select a Subtitle:
What is Goldbach's Conjecture?
Documentation for C# Goldbach's Conjecture Program
>>>
Screen Shot
Results from Goldbach's Conjecture Program
Plot of Results of Goldbach's Conjecture Program
Go to A135733 For every integer m > a(n), 2m can be decomposed into at least n unordered sums of two primes (conjectural).
Go to A045917 From Goldbach problem: number of decompositions of 2n into unordered sums of two primes.
Download Program Files for Execution and/or Development (C# versions)
Return to Harry's Home Page
Page created by:
hjsmithh@sbcglobal.net
Plot of Results of Goldbach's Conjecture Program
Plot of Results of Goldbach's Conjecture Program