let $k$ be an integer, and consider the set $S$ of functions from $\mathbb{N}$ to $\mathbb{N}$ where $g(x) =0$ for all $x>k$. I want to show $S$ is countable.
This is what I have so far, but I am not quite sure if I am going about it correctly, or what to do next.
So our functions will look like this
$A_1=\{(1,a_1),(2,a_2),(3,a_3),(4,a_4),....,(k,a_k), (k+1,0), (k+2,0)....\}$
It seems from here I should be able to show that there are only countable ways of doing this, but I am not quite sure how to say that. I think the best way would to come up with a bijection from the naturals to $S$ but for the life of me I can't come up with one.
I would love some help. Thanks in advance.