Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Two Answers to a Common Question on Diagonalization (1501.01207v1)

Published 5 Jan 2015 in cs.DM

Abstract: A common question from students on the usual diagonalization proof for the uncountability of the set of real numbers is: when a representation of real numbers, such as the decimal expansions of real numbers, allows us to use the diagonalization argument to prove that the set of real numbers is uncountable, why can't we similarly apply the diagonalization argument to rational numbers in the same representation? why doesn't the argument similarly prove that the set of rational numbers is uncountable too? We consider two answers to this question. We first discuss an answer that is based on the familiar decimal expansions. We then present an unconventional answer that is based on continued fractions.

Summary

We haven't generated a summary for this paper yet.