Wolfinger, Bernd E. (2023) The Set of Rationale Numbers is Countably Infinite-A Simple Proof. Journal of Advances in Mathematics and Computer Science, 38 (7). pp. 160-166. ISSN 2456-9968
Wolfinger3872023JAMCS99653.pdf - Published Version
Download (555kB)
Abstract
This research note presents a very simple proof of the interesting fact that the set Q of rationale numbers is still countably infinite as is the set of natural and integer numbers. The proof is based on several innovative ideas and neither relies on Cantor’s well-known diagonalization approach nor on the non-trivial Cantor- Schroeder-Bernstein Theorem.
In addition, we present a new proposal for a simple injective function f: Q
Z, which allows one to encode rationals in a highly efficient manner and at the same time it can be understood much more easily (even by non-mathematicians). Moreover, also the inverse function f -1 can be derived in an extremely simple manner. Nevertheless, the growth of length is only logarithmic if we compare the resulting length of f(r=p/q) with the value of p, while the length of q has no impact at all on the length of f (r). Our approach also allows us to introduce a total ordering for the set of rationale numbers in a straight-forward manner.
Item Type: | Article |
---|---|
Subjects: | Librbary Digital > Mathematical Science |
Depositing User: | Unnamed user with email support@librbarydigit.com |
Date Deposited: | 20 May 2023 11:33 |
Last Modified: | 26 Jul 2024 07:19 |
URI: | http://info.openarchivelibrary.com/id/eprint/735 |