So I attempted to prove that between every rational numbers is an irrational as an exercise, and wanted to see if there are problems in my solution.
Proof:
Suppose $n \in \mathbb{N}$ and $x$ is a positive irrational real number and $y \in \mathbb{Q}$
By the archimedian property there is a $n>0$ such that nx>y
Let $x$ and $y$ be such that $y<nx<x+y$
As $nx>y$, $(n+1)x>y$ , and similarly,$nx<x+y$, so $(n-1)x<y$
so $$(n-1)x<y<(n+1)x$$
Diving throughout by $2m$ and $x$, where $m \in \mathbb{N}$
we get $$\frac{n-1}{2m} < \frac{y}{2mx} < \frac{n+1}{2m} $$
in the case that $n$ is odd, then $n = 2k+1$ where $k \in \mathbb{N}$
which simplifies the inequality to $$\frac{k}{m} < \frac{y}{2mx} < \frac{k+1}{m}$$
AS $\frac{y}{2mx}$ is irrational (can be proven by contradiction), this completes the proof
A similar argument can be constructed if $n$ is even, and if $x$ is negative.
Is this proof valid? can i just say this "Let $x$ and $y$ be such that $y<nx<x+y$"?
Proof that between a pair of rationals $\frac{a}{b}$ and $\frac{c}{d}$ there exists a pair of rationals $\frac{k}{m}$ and $\frac{k+1}{m}$ such that $\frac{a}{b} \leq \frac{k}{m} \lt \frac{k+1}{m} \leq\frac{c}{d}$ where $a,b,c,d,k,m \in \mathbb{Z}$
First consider the case where $b=d$. Then $\frac{a}{b} <\frac{c}{b}$.
So $(c-a)\geq 1$ so for any $n>1 \in \mathbb{N}$, $n(c-a) \gt 1$, and $nc>na+1$
Thus we can say $\frac{na}{nb} \lt \frac{na+1}{nb} \lt\frac{nc}{nb} $ and the pair of rationals are $\frac{k}{m} =\frac{a}{b}$ and $\frac{k+1}{m} = \frac{na+1}{nb}$
For the case where $b \neq d$ , we simply multiply the RHS by d/d and the LHS by b/b and the proof follows from the one above.