Results 1 to 3 of 3

Math Help - Prime Proof

  1. #1
    Member
    Joined
    Feb 2008
    Posts
    79

    Prime Proof

    Prove that if p > 3 is prime then p, p+2, p+4 cannot all be prime.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Member
    Joined
    Feb 2008
    Posts
    79
    Anyone? I can certainly see why by just picking any prime, but can't prove it.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    Joined
    Oct 2008
    Posts
    61
    If p is prime you know p mod 3 = 1 or 2, if p mod 3 = 1 you have (p + 2) mod 3 = 0, so p+2 is divisible by 3 and if p mod 3 = 2 you have (p + 4) mod 3 = 0, so that p+4 is divisible by three.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Relatively Prime Proof
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: November 20th 2010, 12:18 AM
  2. Prime # Proof
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: April 21st 2010, 06:06 PM
  3. Prime proof
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 17th 2010, 01:59 PM
  4. Prime Proof
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: December 4th 2009, 03:17 AM
  5. Prime proof
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: September 5th 2008, 08:03 PM

Search Tags


/mathhelpforum @mathhelpforum