1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Prove the number theory conjecture

  1. Jan 15, 2012 #1
    1. The problem statement, all variables and given/known data

    prove or disprove the following conjecture:

    If n is a positive integar, then n^2 - n +41 is a prime number

    2. Relevant equations

    no, just prove or disprove

    3. The attempt at a solution

    I think one possible answer may be there is no factorization for this except itself and 1.
    not like N^2-1 which can write as (n-1)(n+1)
     
  2. jcsd
  3. Jan 15, 2012 #2

    Dick

    User Avatar
    Science Advisor
    Homework Helper

    Isn't there some value of n for which it's clearly not prime? Maybe n^2 - n +41 divisible by 41?
     
    Last edited: Jan 15, 2012
  4. Jan 15, 2012 #3
    If you think carefully plug in a value for which might be staring at you..... and factor.....
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook