TITLE: How to prove from scratch that there exists $q^2\in(n,n+1)$?
QUESTION [6 upvotes]: Given $n$ a positive integer, how would you prove from scratch that there exists a rational number $q$ such that $n<q^2<n+1$?
By "from scratch" I mean by not using any "advanced" tools like the density of the rational numbers in the real numbers. Just using the definition of rational numbers, how to prove that?
I faced this problem while trying to verify that the Dedekind cut $(A,B)$ cannot be determined by a rational number, where:

$B=\{x \in Q^+: x^2>2\}$
$A=Q\setminus B$

where $Q^+$ denotes the positive rationals.
So, for the purposes of the problem, I still don't even know what the real numbers are.

REPLY [6 votes]: As $1<(\frac54 )^2<2<(\frac32 )^2<3$, we may assume wlog. that $n\ge 3$.
With $q=\frac ab$, our task is to find $a,b$ such that $nb^2<a^2<(n+1)b^2$.
Pick $b=2n^2$; so we want $4n^5<a^2<4n^5+4n^4$.
The set $\{\,k\in\Bbb N\mid k^2>4n^5\,\}$ is a non-empty (contains $3n^3$) subset of $\Bbb N$, hence has a minimal element $a$. Clearly, $a>2n^2>1$.
Then 
$$(a-1)^2=a^2-2a+1>a^2\left(1-\frac 2a\right)>a^2\left(1-\frac 1{n^2}\right) $$
If we assume $a^2\ge 4n^5+4n^4$, this leads to 
$$ (a-1)^2>4n^5+4n^4-4n^3-4n^2=4n^5+4n^2((n-1)^2-2)>4n^5$$
contradicting minimality of $a$.
Hence $a^2<4n^5+4n^4$, as desired.

REPLY [2 votes]: Notice that for $n > 4$
$$ n\sqrt{n + 1} - n \sqrt{n} = \frac{n}{\sqrt{n + 1} + \sqrt{n}}\geq \frac{n}{2\sqrt{n + 1}} > 1$$
so there is an integer $k$ such that
$$n\sqrt{n} \leq k <n \sqrt{n + 1}$$
so
$$n  \leq \frac{k^2}{n^2} <n + 1$$
hence $q := \frac{k}{n}$ is a rational number with the property you are looking for.