Mathematics, Discrete Mathematics, Programming.
When a function is both injective AND surjective, it is also considered to be bijective. To prove this, we simply need to show that a function is both injective and surjective. TLDR: prove that every value inputted into a function maps to a unique output and prove that all possible outputs have a