Is this function injective or surjective: $g: \mathbb{N} \rightarrow \mathbb{N}, n \mapsto 2n^{3}-1$
I don't know how I can say this. I have to find some values for which we see it cannot be injective / surjective? That sounds too general and cheap, is it really done like that?
If so I would say that this function is surjective because we will always get at least one $n$ value for every $f(n)$ value.
It will also be injective because we will not get more than one value $n$ for every $f(n)$.
Thus the function is bijective..?