Q. A function is invertible if it isa) surjectiveb) bijectivec) injective
Function Invertibility: A function is invertible if it has a unique output for every input, and every output is the result of some input. This means that the function must be both injective (one-to-one) and surjective (onto). A function that is both injective and surjective is called bijective.
More problems from Convert an explicit formula to a recursive formula