Home
Class 12
MATHS
Show that the function f : N ->N, given ...

Show that the function `f : N ->N`, given by `f (1) = f (2) = 1`and`f (x) = x 1`, for every `x > 2`, is onto but not one-one.

Promotional Banner

Similar Questions

Explore conceptually related problems

Show that the function f:N rarr N , given by f(1) = f(2) = 1 and f(x) = x - 1, for every x gt 2 , is onto but not one-one.

Show that the function: f: N rarr N given by f(1) = f (2) = 1 and f (x) =x-1 , for every x > 2 is onto but not one-one.

Show that the function f:N to N, given by f (1) =f (2) =1 and f (x) =x -1, for every x gt 2, is onto but not one-one.

Show that the function f:N to N, given by f (1) =f (2) =1 and f (x) =x -1, for every x gt 2, is onto but not one-one.

Show that the function f:N to N, given by f (1) =f (2) =1 and f (x) =x -1, for every x gt 2, is onto but not one-one.

Show that the function f:N to N, given by f (1) =f (2) =1 and f (x) =x -1, for every x gt 2, is onto but not one-one.

Show that the function f: N rarr N, given by f(1) f(2)= 1 and f(x) = x - 1 for every x gt 2, is onto but not one-one.

Show that the function f: N->N given by f(1)=f(2)=1 and f(x)=x-1 for every xgeq2 , is onto but not one-one.

Show that the function f:N rarr N given by f(1)=f(2)=1 and f(x)=x-1 for every x>=2, is onto but not one-one.