Give examples of two functions `f : N to N and g : N to N` such g o f is onto but f is not onto.

Give examples of two functions f:N to Z and g: Z to Z such that g o f is injective but g is not injective.

Any function f:N to R continuous on N.

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

Show that if f:A to B and g: B to C are onto, then gof :A to C is also onto.

Define an onto function. Give one example. (A) A function f:A to B is said to be an onto function if AA b in EE a in A such that f(a)=b (or) if range of f = codomain of f then f is an onto function. Ex. f: R to R such that f(x) = 2x+3

The function f: N to N defined by f(n) =2n+3 is

If f:N to N is defined as f(x)=2x+5 , is f onto?

If f : N to N is defined as f(x) = 2x+5 , is f onto?

f: N to R be any function then show that f is continuous on N .

Are f and g both necessarily onto, if gof is onto ?