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.

Full Text
Published version (Free)

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 call