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

Home > Numbers
Some special sums (Posted on 2015-02-05) Difficulty: 2 of 5
Show that all sums of two consecutive odd prime numbers have at least three prime factors, not necessarily distinct. Example: 3+5=8. 8's factors: 2,2,2.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Odd premise (spoiler) new challenge | Comment 2 of 4 |
(In reply to Odd premise (spoiler) by Steve Herman)

I think this was meant to apply to consecutive primes, restricting to odd primes to account for the oddball 2+3=5.  I can't come up with a complete proof but checking the first 10,000 primes confirms this is true at least that far out so I'm suspecting that a deeper number theory analysis could prove it true for all consecutive primes (excluding 2+3).
  Posted by Daniel on 2015-02-05 14:46:07

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 (1)
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