Register

ISI2015-DCG-37

• recategorized by
314 views
0 votes
0 votes

Suppose $f_{\alpha} : [0,1] \to [0,1],\:\: -1 < \alpha < \infty$ is given by

$$f_{\alpha} (x) = \frac{(\alpha +1)x}{\alpha x+1}$$

Then $f_{\alpha}$ is

  1. A bijective (one-one and onto) function
  2. A surjective (onto ) function
  3. An injective (one-one) function
  4. We cannot conclude about the type
• recategorized by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
gatecse asked Sep 18, 2019
365 views
ISI2015-DCG-17
The set $\{(x,y): \mid x \mid + \mid y \mid \leq 1\}$ is represented by the shaded region in
The set $\{(x,y): \mid x \mid + \mid y \mid \leq 1\}$ is represented by the shaded region in
User Avatar
0 votes
0 votes
1 answer
2
gatecse asked Sep 18, 2019
299 views
ISI2015-DCG-35
Let $A$, $B$ and $C$ be three non empty sets. Consider the two relations given below: $\begin{array}{lll} A-(B-C)=(A-B) \cup C & & (1) \\ A – (B \cup C) = (A -B)-C & & (2) \end{array}$ Both $(1)$ and $(2)$ are correct $(1)$ is correct but $(2)$ is not $(2)$ is correct but $(1)$ is not Both $(1)$ and $(2)$ are incorrect
Let $A$, $B$ and $C$ be three non empty sets. Consider the two relations given below:$$\begin{array}{lll} A-(B-C)=(A-B) \cup C & & (1) \\ A – (B \cup C) = (A -B)-C & & ...
User Avatar
1 votes
1 votes
1 answer
3
gatecse asked Sep 18, 2019
394 views
ISI2015-DCG-27
If $A$ be the set of triangles in a plane and $R^{+}$ be the set of all positive real numbers, then the function $f\::\:A\rightarrow R^{+},$ defined by $f(x)=$ area of triangle $x,$ is one-one and into one-one and onto many-one and onto many-one and into
If $A$ be the set of triangles in a plane and $R^{+}$ be the set of all positive real numbers, then the function $f\::\:A\rightarrow R^{+},$ defined by $f(x)=$ area of t...
User Avatar
3 votes
3 votes
1 answer
4
gatecse asked Sep 18, 2019
485 views
ISI2015-DCG-36
Suppose $X$ and $Y$ are finite sets, each with cardinality $n$. The number of bijective functions from $X$ to $Y$ is $n^n$ $n \log_2 n$ $n^2$ $n!$
Suppose $X$ and $Y$ are finite sets, each with cardinality $n$. The number of bijective functions from $X$ to $Y$ is$n^n$$n \log_2 n$$n^2$$n!$
User Avatar
Link Copied!