Prove the number theory conjecture

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...
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top