Skip to content
Question

Consider set A with ‘a’ elements, set B with ‘b’ elements, set C with ‘c’ elements. We can define a function that is one-one but not onto from set A to set B, a function that is onto but not one-one from set B to set C; and a function that is injective but not surjective from C to A. Arrange a, b, c in ascending order.
Explanation

### Related posts

- February 6, 2014 Algebra Question and Solution Question
|x| + |2y| + |3z| = 13, x * y * z is non-zero; x, y, z are all integers. How many sets of values are possible?
Answer
64 sets of values
Explanation
Posted in Functions
- February 27, 2014 Inequalities Question and Solution
Question
How many positive integer values can x take that satisfy the inequality (x - 8) (x - 10) (x - 12).......(x - 100) < 0?
Explanation
Posted in Inequalities
- October 10, 2014 CAT Permutation Combination and Functions
Question
How many functions can be defined from Set A -- {1, 2, 3, 4} to Set B = {a, b, c, d} that are neither one-one nor onto?
Explanation
To start with, if you do not […] Posted in Combinatorics
- January 28, 2014 Inequalities – Interesting Question
Question
How many positive integer values can x take that satisfy the inequality (x - 8) (x - 10) (x - 12).......(x - 100) < 0?
Answer: 30
Explanation
Let us try out […] Posted in Inequalities