Hello everyone!(adsbygoogle = window.adsbygoogle || []).push({});

I think i got this but i'm not sure if i'm allowed to do this. The question is:

For all integers n, n^2-n+11 is a prime number. Well if that was a prime number it should be true that n^2-n+11 = (r)(s) then r = 1 or s = 1. But if you equate n^2-n+11 = 1, you get a false statement. n^2-n + 12 = 0, and if u plugged say 0 in for n, u get 12 = 0, 12 is not prime...but 12 = 0, doesn't make sense. Am i on the right track or totally doing the wrong test? I'm confused if i'm suppose to set n^2-n+11 to somthing, it won't facotr unless i do a quadtratic but i'm not sure what that would even show me.

Thanks!

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Proving/disproving n^2-n+11 is prime, i think i got it

**Physics Forums | Science Articles, Homework Help, Discussion**