Services & ResourcesWolfram ForumsMathGroup Archive

[Date Index] [Thread Index] [Author Index]

Re: goldbach prime partitions for arbitrary integer n => 4

• To: mathgroup at smc.vnet.net
• Subject: [mg43007] Re: goldbach prime partitions for arbitrary integer n => 4
• From: bobhanlon at aol.com (Bob Hanlon)
• Date: Fri, 8 Aug 2003 00:26:22 -0400 (EDT)
• References: <bgsn4c$nnq$1@smc.vnet.net>
• Sender: owner-wri-mathgroup at wolfram.com

primePartition[n_Integer] :=
    Select[
      Table[
        {Prime[p], n-Prime[p]}, 
        {p, PrimePi[n/2]}], 
      PrimeQ[#[[2]]]&];

primePartition[200]

{{3, 197}, {7, 193}, {19, 181}, {37, 163}, {43, 157}, 
  {61, 139}, {73, 127}, {97, 103}}


Bob Hanlon

In article <bgsn4c$nnq$1 at smc.vnet.net>, gilmar.rodriguez at nwfwmd.state.fl.us
(=?ISO-8859-1?Q?Gilmar_Rodr=EDguez_Pierluissi?=) wrote:

<< If one wishes to compute:
eqn={p+q==200}; constraints={2<=p<=100, p<=q, p,q \[Element]Primes};
wouldn't it be nice that if you evaluate:
Solve[eqn,constraints,{p,q}]
you would get:
{{97,103},{73,127},{61,139},{43,157},{37,163},{19,181},{7,193},{3,197}} ?
A module (or program) that could solve:
eqn={p+q==n}; constraints={2<=p<=n/2, p<=q, p,q \[Element]Primes};
Solve[eqn,constraints,{p,q}]
for a specified n, (n=>4, n \[Element]Integer), would be even better!
 >><BR><BR>

• Follow-Ups:
  • Re: Re: goldbach prime partitions for arbitrary integer n => 4
    • From: Dr Bob <drbob@bigfoot.com>