2

n +1<k < n + 3 :

Prove:

for all integers n, there exists an integer k.

For this to be true, we need to confirm that we can find an integer k that makes
both

n +1<k

and

k < n + 3 true. Since all integers squared is equal to a positive

integer, we know that both

n2 +1n2+ 3 will be integers. If we set an arbitrary integer

y=n 2+3,

we rewrite the original equality as

x=n2 +1

and

x< k < y . We also know that

y=x +2 , so we can rewrite it again as

x< k < x +2 . Subtracting x from all three parts, we get

0< kx <2 . Since there

exists an integer between 0 and 2 (that integer is 1), there exists a k, such that

n
( 2+1)=1 . Thus proving that for every integer n, there is an integer k such that
k x=k
n2 +1<k < n2+ 3.