perplexus.info :: Numbers : 2 sets of primes

2 sets of primes (Posted on 2019-02-04)

M is the smallest possible sum for a set of four distinct primes such that the sum of any three is prime - (p1,p2,p3,p4}.
N is the smallest possible sum for a set of six distinct primes such that the sum of any five is prime - (q1,q2,q3,q4,q5,q6}.

Find M & N and the corresponding sets.

No Solution Yet Submitted by Ady TZIDON

No Rating

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
re: proof 5 impossible	xdog	2019-02-06 06:54:01
proof of smallest	Steven Lord	2019-02-06 02:47:36
proof 5 impossible	Steve Herman	2019-02-05 19:30:05
solution for 6, proof 5 impossible	xdog	2019-02-05 18:30:47
computer soln	Steven Lord	2019-02-05 00:06:52

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info