- #1
sha sam
- 3
- 0
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 I'm going to do.
Please help me.
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 I'm going to do.
Please help me.