Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (anonymous):

Let B be the set of all binary strings with infinite occurrences of 1. We know this to be the subset of A = the set of infinite binary strings (which we know is uncountable). Prove that B is uncountable. Please help I don't know how to find a function that maps A to B, and I don't know how to solve the proof

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!