Can I prove this with help of simple induction grounded on the basic axioms of number theory and a linearity pattern?
$$\frac{-x}{y} \neq \frac{x}{y}$$ $$\frac{-x}{-y} = \frac{x}{y}$$
The complete set of rational numbers according to me. $$P = \left\{\frac{a}{b}, [-\infty \leq (a,b) \leq \infty], \ a,b\in \mathbb Z \right\}$$
A subset of $P$ is $E$.
$E$ is a finite set with 50 unique elements. These elements fit in Hilbert's hotel. $$E = \left\{\frac{a}{b}, [-5 \leq (a,b) \leq 5], \ a,b\in \mathbb Z \right\}$$
I derive the formula $ r = 10k$, where $r$ is the amount of rooms needed.
$r=10k+10$, when k+1. $$ \left\{\frac{a}{b}, [-k \leq (a,b) \leq k], \ a,b\in \mathbb Z \right\}$$
when $k$ goes to infinty $r$ goes to infinity. I have successfully counted the amount of rooms needed for an infinite amount of fractions. This only shows it's possible to fit them in the hotel. But in order to show how, do I need a function to map all fractions systematically?
You didn't show the rational numbers fit. It's obvious that any finite set fits, but the problem is to extend this to infinitely many clients.
You first reserve the chambers with numbers of the form $p_n^m$, for $m\ge1$, where $p_1=3,p_2=5,\dotsc$ is the list of odd prime numbers in increasing order.
Then you reserve the chambers with numbers of the form $2p_n^m$, again for $m\ge1$.
Note that chamber number $0$ is not reserved; in it you place $0$.
Now place the nonzero rational number $m/n$, with $m,n$ coprime and $n>0$, in room number $p_n^m$ or $2p_n^{-m}$ according whether $m>0$ or $m<0$.
Infinitely many rooms will be empty, even among those that have been reserved, but it's not a problem, is it? But you have a precise way to tell where any rational number will be hosted.