Show that the set of functions from the positive integers to the set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} is uncountable. [Hint: First set up a one-to-one correspondence between the set of real numbers between 0 and 1 and a subset of these functions. Do this by associating to the real number 0.d1d2 . . . dn . . . the function f with f(n).

since the set of functions expressed are uncountable and they are a subset of real numbers starting from N therefore the set {0,1,2,3,4,5,6,7,8,9} is uncountable as well as its off functions

Step-by-step explanation:

set = {0,1,2,3,4,5,6,7,8,9}

setting up a one-to-one correspondence between the set of real numbers between 0 and 1

The function : F(n)= {0,1} is equivalent to the subset (sf) of (n) , this condition is met if n belongs to the subset (sf) when f(n) = 1

hence The power set of (n) is uncountable and is equivalent to the set of real numbers given

since the set of functions expressed are uncountable and they are a subset of real numbers starting from N therefore the set {0,1,2,3,4,5,6,7,8,9} is uncountable as well as its offfunctions

x equals 1

step-by-step explanation:

f(4)=f(×)

x=1