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

Let S be the set of all string of 0' s and 1' s,and define D:S→Z as follows:For all s∈S, D(x)=the number of 1' s in s minus the number of 0' s ins. a.Is D one-to-one?Prove or give a counterexample.

OpenStudy (perl):

S must be the set of finite strings of 0's, 1's

OpenStudy (anonymous):

for all s->S. is it??

OpenStudy (perl):

D(x) would not be defined if you had an infinite string of 0's and 1's

OpenStudy (anonymous):

@perl is there any reason ???

OpenStudy (perl):

D is not 1-1

OpenStudy (perl):

|dw:1409479089216:dw|

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!