A function f is surjective (or onto) provided f(A)=B; in other words,

for each b∈B,b=f(a) for some a∈A.

A function f is said to be bijective (or a bijection or a one-to-one correspondence) if it is both injective and surjective.