goldbach prime partitions for arbitrary integer n => 4
- To: mathgroup at smc.vnet.net
- Subject: [mg42986] goldbach prime partitions for arbitrary integer n => 4
- From: gilmar.rodriguez at nwfwmd.state.fl.us (Gilmar Rodríguez Pierluissi)
- Date: Thu, 7 Aug 2003 00:53:44 -0400 (EDT)
- Sender: owner-wri-mathgroup at wolfram.com
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!
Thank you!
- Follow-Ups:
- Re: goldbach prime partitions for arbitrary integer n => 4
- From: Daniel Lichtblau <danl@wolfram.com>
- Re: goldbach prime partitions for arbitrary integer n => 4