In this study, we show how to construct a function from the set [image omitted] of natural numbers that explicitly counts the set [image omitted] of all positive rational numbers using a very intuitive approach. The function has the appeal of Cantor's function and it has the advantage that any high school student can understand the main idea at a glance without any prior knowledge of the Unique Prime Factorization Theorem or other nonelementary results. Unlike Cantor's function, the one we propose makes it very easy to determine what rational number, in unreduced form, is in a given position on the list and vice versa.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados