Question
Prove that a strictly decreasing function is always one-one.
Answer :
Word Count : 147
_____ _______ _____ __________ __________ __________ _____ _________ _____.
_________ _____ _____ ______ _________ _________.
_________ _________ _______ _________ ____ ____ ____ _________ _________.
___ _______ _________ _______ _________ _____ ______ ____ ____ _________ ______.
______ _______ ______ ___ _______ __________ ________ _______ ________ _____ _________.
___ _______ __________ _________ _____ ___ _______ _________ _______.
_______ ____ _________ ___ ____.
___ ______ _____ __________ _____.
________ ________ __________ _____ ________ ____ _____ __________ __________ ___ ____.
Skip in 10
Let ( f ) be a strictly decreasing function. By definition, for any two points ( x_1 ) and ( x_2 ) in the domain of ( f ) with ( x_1 < x_2 ), we have [ f(x_1) > f(x_2). ] To prove ( f ) is one-one, we need to show that if ( f(x_1) = f(x_2)
___ ____ ______ ________ ________ ________ __________ ___ ______ ________ _______ _________._____ _______ _____ __________ __________ __________ _____ _________ _____.
_________ _____ _____ ______ _________ _________.
_________ _________ _______ _________ ____ ____ ____ _________ _________.
___ _______ _________ _______ _________ _____ ______ ____ ____ _________ ______.
______ _______ ______ ___ _______ __________ ________ _______ ________ _____ _________.
___ _______ __________ _________ _____ ___ _______ _________ _______.
_______ ____ _________ ___ ____.
___ ______ _____ __________ _____.
________ ________ __________ _____ ________ ____ _____ __________ __________ ___ ____.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.