2

How can I prove that the statement:

'there is no integer, $n$, such that $4n^2 + 1 < 4n$'

is true, by contradiction?

I greatly appreciate any help with this. Thanks.

Marconius
  • 5,635

2 Answers2

4

Assume that there is an $n$ for which $4n^2+1<4n$. Then

$\begin{align} 4n^2-4n+1<0 &\implies\\ (2n-1)^2<0 \end{align}$

which is a contradiction because $(2n-1)$ is an integer and squares of integers can never be negative.

Marconius
  • 5,635
1

Assume for the sake of contradiction that

$$4n^2+1<4n$$

Well it is certainly the case that

$$4n^2<4n^2+1$$

So we have

$$4n^2<4n^2+1<4n$$

$$4n^2<4n$$ $$4n^2-4n<0$$

$$4n(n-1)<0$$

So $n$ and $n-1$ must be of opposite sign

$n>n-1$ So we take $n-1<0$ and $n>0$ from which we get $0<n<1$ which contradicts our original assumptions that $n\in\mathbb{Z}$

Tucker
  • 2,090
  • 9
  • 12
  • The question states $n \in \mathbb{Z}$ not $n\in\mathbb{N}$. So there is a step where you say if $n = 0$ then $0^2<0$ which is a contradiction, and if $n < 0$ then a square is less than a negative which is also a contradiction. – ignoramus Aug 09 '15 at 02:13
  • 1
    The set of all integers includes negative numbers – Marconius Aug 09 '15 at 02:13
  • Thanks . I overlooked that detail but believe I have been been able to salvage the proof. – Tucker Aug 09 '15 at 02:17