Science:Math Exam Resources/Courses/MATH220/April 2005/Question 03 (c)
• Q1 • Q2 • Q3 (a) • Q3 (b) • Q3 (c) • Q4 • Q5 • Q6 • Q7 • Q8 • Q9 • Q10 • Q11 •
Question 03 (c) |
---|
What does "Cantor's Diagonalization Argument" prove? (You don't have to describe the proof itself - just what it proves.) |
Make sure you understand the problem fully: What is the question asking you to do? Are there specific conditions or constraints that you should take note of? How will you know if your answer is correct from your work only? Can you rephrase the question in your own words in a way that makes sense to you? |
If you are stuck, check the hint below. Consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it! |
Hint |
---|
Here the question simply aims at having you write a very short paragraph about what Cantor's argument proves, no need for complicated math, just a sentence or two that explains what he proved with that argument. (Yes, that's math too :) ) |
Checking a solution serves two purposes: helping you if, after having used the hint, you still are stuck on the problem; or if you have solved the problem and would like to check your work.
|
Solution |
---|
Found a typo? Is this solution unclear? Let us know here.
Please rate my easiness! It's quick and helps everyone guide their studies. Cantor's Diagonalization Argument is used to prove that the set of all real numbers is uncountable. More precisely, it says that if you claim that the set of all real numbers is actually countable, that is, you have a bijection between all real number and the natural numbers, then he would be able to exhibit you a real number (using the diagonalization argument) that is not listed by your bijection. This means it is a contradiction to assume that such a bijection could exist and hence the real numbers are uncountable. |