Bijective Function
A bijective function is both one-to-one and onto, so every output has exactly one matching input.
Definition · Example · CSE Use →Definitions, examples and Computer Science applications for this mathematics subject.
A bijective function is both one-to-one and onto, so every output has exactly one matching input.
Definition · Example · CSE Use →The ceiling function returns the smallest integer greater than or equal to a number.
Definition · Example · CSE Use →The codomain is the declared set in which a function’s outputs are expected to lie.
Definition · Example · CSE Use →A composite function applies one function to the result of another.
Definition · Example · CSE Use →The domain of a function is the set of all allowed input values.
Definition · Example · CSE Use →An exponential function has the variable in the exponent and changes by a constant multiplicative factor.
Definition · Example · CSE Use →The floor function returns the greatest integer less than or equal to a number.
Definition · Example · CSE Use →A function maps each input in its domain to exactly one output.
Definition · Example · CSE Use →An inverse function reverses the effect of a bijective function.
Definition · Example · CSE Use →A logarithmic function is the inverse of an exponential function.
Definition · Example · CSE Use →A one-to-one or injective function never maps two different inputs to the same output.
Definition · Example · CSE Use →An onto or surjective function reaches every element of its codomain.
Definition · Example · CSE Use →A piecewise function uses different formulas for different parts of its domain.
Definition · Example · CSE Use →The range of a function is the set of output values the function can produce.
Definition · Example · CSE Use →A recursive function is defined using values of the same function on smaller inputs together with a base case.
Definition · Example · CSE Use →