Confirming your payment

Skip to content

Practice Questions · Question 28 of 30

A storage system labels its slots with the whole numbers W = 0, 1, 2, 3, … , but the items it stores are indexed by…

Question 285 marksHard

A storage system labels its slots with the whole numbers W={0,1,2,3,… }W = \{0, 1, 2, 3, \dots\}, but the items it stores are indexed by the integers Z\mathbb{Z}. The labelling rule is the function h:Z→Wh : \mathbb{Z} \to W given by

h(n)={2n,n≥0−2n−1,n<0h(n) = \begin{cases} 2n, & n \geq 0 \\ -2n - 1, & n < 0 \end{cases}

A number line of the integers from -3 to 3 above a row of whole-number slots 0 to 6, with no arrows drawn betw

(i) Prove that hh is one-one.

(ii) Prove that hh is onto. For each m∈Wm \in W produce the integer nn with h(n)=mh(n) = m, and check that the nn you produce really satisfies the condition of the branch you used.

(iii) The system is now restricted so that only items with n≥0n \geq 0 may be stored. State, with reasons, whether the restricted function is still one-one and whether it is still onto.