what is the easiest way to prove a function si one to one? Also to prove it's not one to one...
Define $f : \mathbb{N} \to \mathbb{N}$ by $f(n) = \cdots$. Define $g : \mathbb{N}\times\mathbb{N} \to N$ by $g(m, n) = \cdots$.
For $f$ and $g$ I need to say if it's one to one or not one to one, I'm not sure what kind of values I should expect (it's a very entry level course into discrete mathematics) Would anyone be able to hazard a bit of a guess as to what the values should be?