<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05838513</id>
  <dt>j</dt>
  <an>2011a.00566</an>
  <augroup>
    <au>Almada, Carlos</au>
  </augroup>
  <ti>On counting the rational numbers.</ti>
  <so>Int. J. Math. Educ. Sci. Technol. 41, No. 8, 1096-1101 (2010).</so>
  <py>2010</py>
  <pu>Taylor \& Francis, Abingdon, Oxon</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
    <cc>F44</cc>
    <cc>F45</cc>
    <cc>K24</cc>
    <cc>K25</cc>
    <cc>E64</cc>
    <cc>E65</cc>
  </ccgroup>
  <utgroup>
    <ut>counting the rationals</ut>
    <ut>rational numbers</ut>
    <ut>countable sets</ut>
    <ut>Cantor's function</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1080/0020739X.2010.500695</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In this study, we show how to construct a function from the set $\bbfN$ of natural numbers that explicitly counts the set $\bbfQ^+$ 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.</ab>
    <rv></rv>
  </abgroup>
</item>