# Trouble with Discrete Math proof

This seemingly easy proof is giving me some trouble..

For every number n $\in$ $Z$, if $n>n^2+1$ then $n\leq0$.

I find that proving the conditional statement P implies Q is false. For example $n=-2$, it is false that $-2>(-2)^2+1$.

But proving the contrapositive is true (not Q implies not P). If $n>0$ then $n\leq n^2 +1$

Can someone point out where I might be going wrong? Thanks!

• Have you tried sketching a graph of $n$ and $n^2+1$? – Mark S. Jan 13 '16 at 17:46
• Mark - Thank you, I didn't think of that. The statement seems true after all! P implies Q is a False implying anything, so the statement should be true which which is consistent now with the contrapositive being true. Thanks! – Justin Jan 13 '16 at 17:50

The statement given is false. Note that $n^2+1$ is strictly positive so if $n>n^2+1$ then $$n>n^2+1>0$$
• Ok - but why does it seem the contrapositive is true? Did I state it correctly? For the contrapositive I would have the statement: $0<n<n^2+1$, which is true. – Justin Jan 13 '16 at 17:38
• But $n^2+1>0$... @MarkS. whatt am I missing here? – fosho Jan 13 '16 at 17:54
• Certainly, $A>B>0$ always implies $A>0$. But does that mean it can't also imply $A\le0$? – Mark S. Jan 13 '16 at 18:03