" Let "f:N rarr N" be defined by "f(n)={[(n+1)/(2)," if "n" is odd "],[(n)/(2)," if "n" is even "]" for all "n in N

Let f: N to N be defined by f (n) = {{:((n +1)/( 2 ), if n " is odd" ), ( (n)/(2), "if n is even "):} for all n in N. State whether the function f is bijective. Justify your answer.

Let : f: N rarr N be defined by f(n)={{:((n+1)/2," if n is odd"),(n/2," if n is even"):} for all n inN . State whether the function f is bijective . Justify your answer.

Let f:N rarr N defined by f(n)={{:((n+1)/(2) " if n is odd"),(n/2" if n is even"):} then f is

Let f: N to N be defined by f(n) = {{:((n+1)/2, " if n is odd "),(n/2, " if n is even "):} for all n in N . State whether the function f is bijective.

Let f : N rarr N be defined by f(n) = {{:((n+1)/(2), if "n is odd"),((n)/(2),"if n is even"):} Show that f is many one and onto function.

Let f: N rarr N be defined by : f(n) = {:{((n+1)/2, if n is odd),(n/2, if n is even):} then f is

Let f:N to N be defined by f(n)={{:((n+1)/2, " if n is odd"),(n/2, "if n is even"):} for all n in N . Prove that f is many-one, onto function.