diff options
| author | joshuab <> | 2010-07-11 19:56:14 +0000 |
|---|---|---|
| committer | bnewbold <bnewbold@adelie.robocracy.org> | 2010-07-11 19:56:14 +0000 |
| commit | 323ba95313391508b7c8e678845c9c6603f3536d (patch) | |
| tree | 486b5983ad4753c32ae6fdedc18e34def8e36b1b /ClassJune28.page | |
| parent | 34555dc5d686e2d8f2a05b581691ad28089d78fe (diff) | |
| download | afterklein-wiki-323ba95313391508b7c8e678845c9c6603f3536d.tar.gz afterklein-wiki-323ba95313391508b7c8e678845c9c6603f3536d.zip | |
d
Diffstat (limited to 'ClassJune28.page')
| -rw-r--r-- | ClassJune28.page | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/ClassJune28.page b/ClassJune28.page index f2b1c23..40799dc 100644 --- a/ClassJune28.page +++ b/ClassJune28.page @@ -24,7 +24,7 @@ A set is called countable if it has the same cardinality as the natural numbers, Cardinality holds some surprises, though. For example, there are as many pairs of natural numbers as there are natural numbers; the set $\mathbb{N}\times\mathbb{N}$ is countable. They can be enumerated by following the zig-zag path through the cartesian grid of pairs below. - + 1-->0. ## Proof that no. of available functions is greater than number of functions required to define the periodic function |