Let there is a function f: E -> N such that f(e) = e/2
Now we have to prove that f is one-one and onto
First we will prove that f is one one
we prove it by contradiction,
if possible then assume f is not one one
there there must exist x1, x2 \in E and x1 != x2 (2)
but f(x1) = f(x2) (1)
By definition of E, x1 = 2 x n1 and x2 = 2 x n2, where n1, n2 \in N
from (1)
2 x n1 = 2 x n2 => 2 x n1/2 = 2 x n2/2 (Halving both sides maintains equality)
it means n1 = n2. thus contradiction arrives, hence our assumption is wrong. Hence f:E->N is one one.
Now we prove that f is onto. Again proving by contradiction.
Let f be not a onto function from E -> N
Let there is y \in N such that inverse_f(y) = 2 x y for y\in N 2y \notin E, which is impossible as per the definition of E
Hence there exists one to one onto function f: E->N as defined
Agreed. Amit now I want you to solve this problem. I think you can write a good proof.