[1] N. Calkin and H. S. Wilf, Recounting the rationals, The American
Mathematical Monthly 107(4) (2000), 360-363.
DOI: https://doi.org/10.1080/00029890.2000.12005205
[2] J. Czyz and W. Self, The rationals are countable–Euclid’s
proof, The College Mathematics Journal 34(5), (2003), 367-369.
DOI: https://doi.org/10.1080/07468342.2003.11922032
[3] H. B. Enderton, Elements of Set Theory, Academic Press, 1977.
[4] J. Gibbons, D. Lester and R. Bird, Functional pearl: Enumerating
the rationals, Journal of Functional Programming 16(3) (2006),
281-291.
DOI: https://doi.org/10.1017/S0956796806005880
[5] R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics:
A Foundation for Computer Science (2nd ed.), Addison-Wesley, 1994.
[6] P. R. Halmos, Naive Set Theory, Van Nostrand, 1960.
[7] A. Malter, D. Schleicher and D. Zagier, New looks at old number
theory, The American Mathematical Monthly 120(3) (2013), 243-264.
DOI: https://doi.org/10.4169/amer.math.monthly.120.03.243
[8] W. Rudin, Principles of Mathematical Analysis (3rd ed.),
McGraw-Hill, 1976.
[9] B. E. Wolfinger, The set of rationale numbers is countably
infinite–A simple proof, Journal of Advances in Mathematics and
Computer Science 38(7) (2023), 160-166.
DOI: https://doi.org/10.9734/jamcs/2023/v38i71781