Mathematics, Discrete Mathematics, Programming.
numbers. As you can see this function is injective since two different values will always map to different outputs, as seen that a is not equal to b. So how do we prove that a function is not injective? To prove this, we want to show that two possible inputs map to the same output. Ex. f : Z→ N