Looking for n for which all 2-partitions are prime partitions.

*To*: mathgroup at smc.vnet.net*Subject*: [mg60267] Looking for n for which all 2-partitions are prime partitions.*From*: "Gilmar" <gilmar.rodriguez at nwfwmd.state.fl.us>*Date*: Fri, 9 Sep 2005 04:07:06 -0400 (EDT)*Sender*: owner-wri-mathgroup at wolfram.com

Dear Mathematica User Group: Is it possible to find an even number n => 4 such that the values (n - Prime[i]) are primes for ALL integers i in the interval [1, PrimePi[n/2]]? In other words; does an n exists having a corresponding set {{a,b}: (a + b) = n, with all a,b element of Primes}? A way to begin attacking this problem follows: Let "PrimeP" be the set of prime partition points {p,q} corresponding to n, such that n = p + q; p and q are prime; and p is less or equal than q. Let "CompP" be the set of composite partition points {p,q} corresponding to n, such that n = p + q; p is prime but, q is composite; and p is less or equal than q. Let "AllP" be the (disjoint) union of the sets PrimeP and CompP. Let "LPrimeP", "LCompP", and "LAllP" denote the lengths of the sets PrimeP, CompP, and AllP, respectively. For what n's is LPrimeP > LCompP? A program for heuristic exploration of this later question follows : Off[General::"spell1"] Clear[LAll,LPrimeP,LCompP] LAllP[n_Integer?Positive]:=Length[Transpose@{n-#,#}&@ Select[n-Prime@Range@PrimePi[n/2],IntegerQ]] LPrimeP[n_Integer?Positive]:=Length[Transpose@{n-#,#}&@ Select[n-Prime@Range@PrimePi[n/2],PrimeQ]] LCompP[n_Integer?Positive]:=Block[{c},c=(LAllP[n]-LPrimeP[n]);c] For[n=4,n<Infinity,If[LPrimeP[n]>LCompP[n], Print[{n,LPrimeP[n],LCompP[n]}]];n+=2] After running this program for a while; the value {30030,905,850} is eventually reached. Unfortunately, seeking n > 30030 implies me having to abort the program, since it stalls forever. I'm just wondering if anyone could suggest an alternative approach, (a proof that such an n doesn't exist would be perfect!) but, seriously; someway to faccilitate and accelerate the calculations to reach values of n higher than 30030. Thank you for your help!