Let and . Consider the function defined by . Show that is one-one and onto; hence find .
Answer: is one-one and onto;
Solution
One-one: let .
Expanding and cancelling the common terms:
so is one-one.
Onto: let and solve for .
For every this gives a valid , so is onto. Hence is a bijection and invertible.
Expanding and cancelling the common terms:
so is one-one.
Onto: let and solve for .
For every this gives a valid , so is onto. Hence is a bijection and invertible.
CBSE Class 12 Board · 2012 · Subjective