Results 1 to 2 of 2

Math Help - Need help on an easy proof for everyone

  1. #1
    Newbie
    Joined
    Mar 2010
    Posts
    5

    Need help on an easy proof for everyone

    nvm
    Last edited by FamilyGuy34; March 7th 2010 at 05:16 PM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Banned
    Joined
    Oct 2009
    Posts
    4,261
    Quote Originally Posted by FamilyGuy34 View Post
    prove that if p1, p2, ....... pn are distinct prime numbers with p1 = 2 and n > 1, then p1, p2,........pn +1 can be written in the form 4k + 3 for some integer k




    Hint: I know that every odd integer can be written as 4k + 3 for an integer k


    Try to write 5 as 4k+3, for some integer k....

    And the first claim's false, too: 2\cdot 3=6 cannot be written as 4k+3 for no integer k.

    Check what you're trying to achieve.

    Tonio
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] Very easy proof
    Posted in the Differential Geometry Forum
    Replies: 4
    Last Post: May 11th 2011, 11:35 AM
  2. Need help on an easy proof
    Posted in the Discrete Math Forum
    Replies: 9
    Last Post: February 23rd 2010, 09:30 PM
  3. Easy Proof
    Posted in the Pre-Calculus Forum
    Replies: 3
    Last Post: June 19th 2009, 09:05 PM
  4. Easy Proof Help
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: October 31st 2007, 01:25 PM
  5. Probably an easy gcd proof
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: April 5th 2007, 06:51 PM

Search Tags


/mathhelpforum @mathhelpforum