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,


  Submitted by David Shin    
Rating: 3.1667 (6 votes)
Solution: (Hide)
Let p and q be consecutive odd primes. Since p+q is even, we may immediately factor p+q = 2*((p+q)/2). Furthermore, since ((p+q)/2) is a number strictly between p and q, and since there are no primes between p and q, we know that ((p+q)/2) has at least two prime factors. This makes at least 3 total prime factors.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsSome thoughts on a particular caseK Sengupta2007-05-11 13:02:14
Some Thoughtsi goofedAdy TZIDON2005-01-24 19:54:49
Some Thoughtsre: at least 3 - WRONGe.g.2005-01-24 16:16:49
re: at least 3Tristan2005-01-24 15:47:57
Solutionat least 3Ady TZIDON2005-01-24 15:14:59
SolutionSolutionOld Original Oskar!2005-01-24 13:56:19
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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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