All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
2 sets of primes (Posted on 2019-02-04) Difficulty: 3 of 5
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: ( Back to comment list | You must be logged in to post comments.)
proof of smallest | Comment 4 of 5 |
Since we are getting to proofs (which I applaud): my (simplistic) proof, that I indeed found the minimal M and N, is that I searched further, adding together any and all primes just beyond the "minimal" M and N sums that I found, and these yielded no lesser M and N's. Since any newly considered prime will add beyond M and N, I indeed found the two minima. QED


Edited on February 6, 2019, 3:02 am
  Posted by Steven Lord on 2019-02-06 02:47:36

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 (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information