- #1
mr_coffee
- 1,629
- 1
Hello everyone!
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!
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!