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

question 7

Essay

Let $S$ be the set of all strings in 0's and 1's, and define a function $F : S \rightarrow \mathbf { Z } ^ { \text {nonneg } }$ as follows: for all strings $s$ in $S$ ,
$$F ( s ) = \text { the number of } 1 \text { 's in } s .$$
(a) What is $F ( 001000 ) ? F ( 111001 )$ ? $F ( 10101 )$ ? $F ( 0100 )$ ?
(b) Is $F$ one-to-one? Prove or give a counterexample.
(c) Is $F$ onto? Prove or give a counterexample.
(d) Is $F$ a one-to-one correspondence? If so, find $F ^ { - 1 }$ .

---

Definitions:

Outstanding Stock

The total shares of a corporation's stock that are currently owned by all its shareholders, including shares held by institutional investors but excluding shares owned by the corporation itself.

Cash

Cash involves money in the form of currency, which includes bank notes and coins, that is in hand or readily available in deposit accounts for immediate use.

Building

A structure established or built from materials to provide shelter or accommodate individuals, businesses, or activities.

Consolidation

The process of combining financial statements of parent and subsidiary companies into one comprehensive set of statements.