Hey all,,

This is my first post in the math forum, and probably not my last.

I am working on a discrete math structures assignment, and am having a little bit of a problem understanding some aspects of logical proofs. the methods we have covered are: induction, contradiction, indirect, and counter example.

the question i am having trouble with is:
prove:
n^2 + 41n + 41 is prime for every int n.

I know that it is true, but how the heck do i prove it?