I need to prove that there are uncountably many functions from N to N using a diagonal argument.

I begin by saying, suppose there are countably many function from N to N.

Therefore they can be listed....

However i'm not sure how to build a function which leads to a contradiction.

Help would be greatly appreciated. Thanks.