Primes'_Medium_Theorem_and_Goldbach_conjecture
- To: mathgroup at smc.vnet.net
- Subject: [mg103300] Primes'_Medium_Theorem_and_Goldbach_conjecture
- From: a boy <a.dozy.boy at gmail.com>
- Date: Mon, 14 Sep 2009 07:10:49 -0400 (EDT)
<img src="http://docs.google.com/View?id=dc3chq94_3g75hb6fh"/> Prime axiom => Primes' Medium Theorem => Enhanced Goldbach conjecture. This is my proof to Goldbach conjecture. n-=F0(n) is the key. Mathematica code: n=10 Prime[n] PrimePi[n] primeList3=Table[Prime[i],{i,2,n}]; sets=Subsets[primeList3,{2}]; mediumList=Join[primeList3,Sum[x,{x,#}]/2&/@sets]; mediumSet=Sort[DeleteDuplicates[mediumList]] For[j=1,j<=Length[mediumSet],j++, If [mediumSet[[j]] >(2+j),Break[]] ]; mediumSup =mediumSet[[j-1]] pos=(Prime[n]+Prime[n-PrimePi[n]])/2 mediumSup-pos tally=Tally[mediumList]; Max[Last/@tally]