Recent content by sha sam

Is this proof on real numbers correct? Then how do I proceed from here to show the bijection from N to N is uncountable? Let A be a set of Real numbers between numbers 0 and 1. Suppose x0, x1, x2, ... is any sequence of elements of A, there is an element xεA that is not in the sequence...

Not really sure how to do that. Can you please help me out?

1. The problem statement Need to prove that the set of bijections from N to N is uncountable.2. The attempt at a solution I'm not really sure how to proceed here but what I did so far is this... f(2i) = { 2i+1, if fi(2i)=2i 2i , if fi(2i)not equal to =2i }Not very sure what...