A proof of Goldbach's conjecture with a logical formulation of finding minimum limit to the number prime pairs for any even number.
Monday, July 25, 2011
Goldbach's Conjecture
Goldbach's conjecture is one of the oldest unsolved problem in mathematics.
Problem: Prove that any even number greater than 2 is the sum of two primes.
My solution:
Critical even number mostly has the least amount pairs of two primes. The formulation of the average amount pairs of two primes of critical even number formulated in logical processes due to perform minimum limit (lower bound) amount pairs of two primes for any even number. Then these formula drew into graphs in Visual Basic. The graph is just drawn for very limited even numbers among all infinite even numbers as shown on both graphs.
View the formulation theoretical :
CLICK HERE !
Special comment sent via Email to: sudarmajiadza@yahoo.com
Subscribe to:
Posts (Atom)