Results 1 to 2 of 2

Math Help - Does this proof make sense, probably wrong...

  1. #1
    Member
    Joined
    Jan 2008
    Posts
    175

    Does this proof make sense, probably wrong...

    Prove or Disprove that for p1p2....pn +1 is prime for every positive integer n, where p1,p2,....pn are the n smallest prime numbers.

    What I did to answer this, I used the fact that n^2 + 1 is prime for all postive integers.

    Then substituted (p(1n) x p2(n+1))^2 +1.

    is this a valid proof for this question? after all the multiplying and factoring is done?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Dec 2007
    From
    Melbourne
    Posts
    428
    I don't really understand what you are doing or what the steps you have not written in are, but n^2+1 isn't prime for some positive integers, eg n=3.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Does this inductive proof make sense?
    Posted in the Discrete Math Forum
    Replies: 7
    Last Post: April 10th 2013, 08:52 PM
  2. Does this make sense?
    Posted in the Calculus Forum
    Replies: 2
    Last Post: April 4th 2011, 03:20 PM
  3. This does not make sense
    Posted in the Algebra Forum
    Replies: 3
    Last Post: November 11th 2008, 02:23 PM
  4. Make Sense??
    Posted in the Algebra Forum
    Replies: 1
    Last Post: July 31st 2008, 11:06 PM
  5. Does this make sense?
    Posted in the Advanced Statistics Forum
    Replies: 0
    Last Post: May 5th 2008, 09:17 PM

Search Tags


/mathhelpforum @mathhelpforum