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

 Purely prime (Posted on 2013-02-19)
Twenty-one prime numbers are in arithmetic sequence with difference d. Prove that d is divisible by 9699690.

 No Solution Yet Submitted by Danish Ahmed Khan Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 Just the proof (spoiler) | Comment 1 of 3
Well, d must be divisible by 2, in order that none of the numbers are divisible by 2.  Similarly, d must be divisible by 3, in order that none of the numbers are divisible by 3.  Same for 5, 7, 11, 13, 17 and 19.

Thus, d is divisible by 2*3*5*7*11*13*17*19 = 9699690.

(As noted in relation to another puzzle recently, this proof is complete, with no need to find 21 numbers prime numbers in arithmetic sequence)

 Posted by Steve Herman on 2013-02-19 14:45:47

 Search: Search body:
Forums (0)
Random Problem
Site Statistics
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox: