- Accounting Homework Help
- Biology Homework Help
- Chemistry Homework Help
- Computer Science Help
- Economics Homework Help
- Engineering Homework Help
- English Homework Help
- Essay Writing Services
- Finance Homework Help
- Management Homework Help
- Math Homework Help
- Matlab Programming Help
- Online Exam Help
- Online Quiz Help
- Physics Homework Help
- Statistics Homework Help

- Physics Assignment Help
- Chemistry Assignment Help
- Math Assignment Help
- Biology Assignment Help
- English Assignment Help
- Economics Assignment Help
- Finance Assignment Help
- Statistics Assignment Help
- Accounting Assignment Help
- Computers Assignment Help
- Engineering Assignment Help
- Management Assignment Help

When a function is said to be as onto function

A function f from a set A to a set B is said to be onto(surjective) , if and only if for every element y of B , there is an element x in A such that f(x) = y , that is, f is onto if and only if f( A ) = B .

Example: The function f(x) = 2x from the set of natural numbers N to the set of non-negative even numbers E is an onto function. However, f(x) = 2x from the set of natural numbers N to N is not onto, because, for example, nothing in N can be mapped to 3 by this function.