Abstract
A class of simple resistor networks is used to enumerate the set of positive rational numbers. A one-to-one correspondence between the simple resistor networks and rational numbers is established, and efficient algorithms to find the rational for a given ordinal number, to find the ordinal number for a given rational, and to generate the rationals up to a given ordinal number are presented. The bijection and the algorithms answer some typical questions that are frequently asked by students in discrete mathematics or computing theory classes related to counting positive rational numbers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
