## Abstract

We present three different ways of getting an actually computable enumeration of Q+ in the sense of being able to know exactly which rational occupies a given position and vice versa. The first enumeration is based on the Pierce expansion model for representing real numbers. The other two are based on regular continued fractions. © 1996 Kluwer Academic Publishers.

Original language | English |
---|---|

Pages (from-to) | 369-377 |

Journal | Order |

Volume | 13 |

Issue number | 4 |

Publication status | Published - 1 Dec 1996 |

## Keywords

- Bijection
- Continued fractions
- Enumeration
- Pierce expansions

## Fingerprint

Dive into the research topics of 'On actually computable bijections between ℕ and Q^{+}'. Together they form a unique fingerprint.