My Math Forum Prove that f: N -> {0,1} is uncountable

 Applied Math Applied Math Forum

 November 23rd, 2011, 11:08 AM #1 Newbie   Joined: Nov 2011 Posts: 1 Thanks: 0 Prove that f: N -> {0,1} is uncountable I need to prove that f: N -> {0,1} is uncountable. Can anyone help me with this proof? Thanks!
November 23rd, 2011, 11:46 AM   #2
Senior Member

Joined: Oct 2011
From: Belgium

Posts: 522
Thanks: 0

Re: Prove that f: N -> {0,1} is uncountable

Quote:
 b) the set of all functions from N to {0,1} is uncountable Any such function f:N->{0,1} can be seen as a sequence {a(n)}, n=0,1,2,..., where a(n) is 0 or 1. From such a sequence, let's build the number 0.a(0)a(1)a(2)a(3)a(4)... which is not a product, but the 0s and 1s written one after the other. So, to a function we associate a sequence, which in turn can be associated to a real number in [0,1] written in binary form. This association is almost unique (with the same problem we have for repeated 1s, like 0.01111111.... which is the same as 0.1, but this isn't a problem). In this way our set of functions is (almost) uniquely mapped to the reals in [0,1], which is an uncountable set.

 Tags >, prove, uncountable

,
,
,

,

# (0.1) uncountable

Click on a term to search for related topics.
 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post 450081592 Real Analysis 2 November 23rd, 2011 06:34 PM whatlifeforme Number Theory 1 October 30th, 2011 04:53 AM wannabe1 Real Analysis 5 September 22nd, 2010 03:18 PM cxc001 Applied Math 2 April 19th, 2010 11:31 AM vaevictis59 Applied Math 18 March 16th, 2010 09:14 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top