My question is:
The function z from to is defined recursively by:
for all .
Show that z is neither an injection or a surjection.
What I've done so far is find the first couple of values of z(n) up to n=7, where I got z(2)=2, z(3)=7, z(4)=5, z(5)=4, z(6)=9, and z(7)=6. At this point, I'm not sure about what to do, so any help would be greatly appreciated!