Prove the number theory conjecture

Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
2 replies · 2K views
yeland404
Messages
23
Reaction score
0

Homework Statement



prove or disprove the following conjecture:

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

Homework Equations



no, just prove or disprove

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)
 
Physics news on Phys.org
Isn't there some value of n for which it's clearly not prime? Maybe n^2 - n +41 divisible by 41?
 
Last edited:
If you think carefully plug in a value for which might be staring at you... and factor...