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

Home > Numbers
Special primes (Posted on 2012-02-12) Difficulty: 3 of 5
There are two primes, both below 100, that evenly divide the sum of the primes less than themselves.

Find those two primes.

The only other such prime below 2,000,000 is M, the n-th prime.

Find M and n.

See The Solution Submitted by Ady TZIDON    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution computer solution | Comment 1 of 3

 10     while p<20000000
 20        p=nxtprm(p)
 30        inc n
 40        if sum @ p = 0 then print p,n,sum,sum//p
 50        sum=sum+p
 60     wend  
 
 finds


 
  prime        n  sum of prev  multiple
      2        1            0       0
      5        3            5       1
     71       20          568       8
 369119    31464   5536785000   15000


 
So the two primes of the first part are 5 and 71, as, presumably, 2 doesn't count even though it "divides" zero evenly.

For the second part, M is 369,119 and n is 31,464. The sum of the first 31,463 primes is 5,536,785,000, which is 15,000 times 369,119.

BTW the program checks up to 20,000,000 and doesn't find another case.


  Posted by Charlie on 2012-02-12 18:26:57
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:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information