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

Home > Numbers
Prime count (Posted on 2021-06-16) Difficulty: 2 of 5
101 is a sum of n distinct primes,

What is the greatest value of n ?

No Solution Yet Submitted by Ady TZIDON    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution | Comment 1 of 3
The sum of the first 9 primes is 100, so for there to be a solution with 9 distinct primes we'd need to replace one of them with a prime that is 1 greater, which isn't possible.  Therefore the largest possible solution would be when n = 8, which is easily found as the first 7 primes + 43. 

2 + 3 + 5 + 7 + 11 + 13 + 17 + 43 = 101

  Posted by tomarken on 2021-06-16 07:44:34
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 (0)
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