483 views

1 Answer

Best answer
2 votes
2 votes

Let us discuss one by one :

I)  f : A --> B s.t    A  ∈  N  and B ∈  {0,1}.

We know when cardinality of A is m and that of B is n , then number of functions from A to B = nm

So in this case no of functions = 2|N|  

We know the set of natural  numbers is countably infinite and the second point is under countable objects , we have 2 types : a) Countably finite    b) Countably infinite 

So if a set is countably infinite also then it is also considered to be countable.

Now coming to this ,hence cardinality of set of natural numbers is countably infinite.But by Cantor's Theorem :

If  N is countably infinite then 2N is uncountably infinite.

Hence here the number 2|N|  is uncountably infinite and hence uncountable.So I) is false.

II)  Given ,  f : A --> B where A ∈ {0,1} and B ∈ N.

So number of such functions =  N2  

Now N is countably infinite and '2' is countably finite so the result is going to be countably infinite since here the Cantor's theorem condition is not satisfied here the base is countably infinite whereas in previous case we had exponent as countably infinite.Also by mathematical notion , 

2N   >>>  N2  (meaning much greater)

Hence II) is countably infinite and hence countable as mentioned earlier.

III) The largest subset of a set is the set itself .So in this case is the set of natural numbers which is countably infinite and hence countable .So III) is also countable.

Hence  B should be the correct option.

selected by