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

Home > Just Math
Consecutive Primes (Posted on 2005-01-24) Difficulty: 2 of 5
Show that the sum of two consecutive odd primes has at least 3 (not necessarily distinct) prime factors. For example,


See The Solution Submitted by David Shin    
Rating: 3.1667 (6 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: at least 3 | Comment 3 of 6 |
(In reply to at least 3 by Ady TZIDON)

That is not the case, for 7+11 does not equal 2*2*n where n is an integer.
  Posted by Tristan on 2005-01-24 15:47:57

Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information