Examlex

Solved

Let SS Be the Set of All Strings in 0's and 1's

question 17

Essay

Let SS be the set of all strings in 0's and 1's, and define a function gg : SZS \longrightarrow \mathbf { Z } as follows: for each string ss in SS ,
g(s)=g ( s ) = the number of 1's in ss minus the number of 0 's in s.s .
(a) What is g(101011)?g(00100)g ( 101011 ) ? g ( 00100 ) ?
(b) Is gg one-to-one? Prove or give a counterexample.
(c) Is gg onto? Prove or give a counterexample.


Definitions:

Women

Female human beings; often discussed in numerous contexts including social, biological, cultural, and political.

Middle-Aged

Refers to the period in human life roughly between the ages of 40 and 65, often characterized by stability in relationships, career, and personal life.

Low Tar Cigarettes

Cigarettes that are designed to produce less tar and nicotine when smoked, in an effort to be a "healthier" alternative to regular cigarettes.

Nicotine

A stimulating and addictive substance found in tobacco that affects the nervous system and is a major component in cigarettes.

Related Questions