92 views
0 0 votes

Let $f:A\to B$ be defined by $f(x)=\frac{3x-5}{2x+1}$. Which of the following choices of $A$ and $B$ makes $f$ a bijection?

  1. $A=\mathbb R$ and $B=\mathbb R$
     
  2. $A=\mathbb R-{-\frac12}$ and $B=\mathbb R$
     
  3. $A=\mathbb R-{-\frac12}$ and $B=\mathbb R-{\frac32}$
     
  4. $A=\mathbb R-{\frac32}$ and $B=\mathbb R-{-\frac12}$

1 Answer

0 0 votes

The function is $f(x)=\frac{3x-5}{2x+1}$.

First, $2x+1\neq 0$, so $x\neq -\frac12$. Therefore, the domain cannot be $\mathbb R$. Hence $A=\mathbb R-{-\frac12}$.

Now find the value that $f(x)$ can never take. 

Let $y=\dfrac{3x-5}{2x+1}$.

$\Rightarrow y(2x+1)=3x-5$.

$\Rightarrow 2xy+y=3x-5$.

$\Rightarrow 2xy-3x=-y-5$.

$\Rightarrow x(2y-3)=-(y+5)$.

$\therefore x=\frac{-(y+5)}{2y-3}$.

This is defined only when $2y-3\neq 0$, so $y\neq \frac32$.

Thus, the range of $f$ is $\mathbb R-{\frac32}$.

So if $A=\mathbb R-{-\frac12}$ and $B=\mathbb R-{\frac32}$, then every element of $B$ has exactly one preimage in $A$. Therefore, $f$ is both one-one and onto.

Hence $f:\mathbb R-{-\frac12}\to \mathbb R-{\frac32}$ is a bijection.

Answer:
Position:
Show:

Related questions

1 1 vote
1 1 answer
102
102 views
GO Classes asked May 15
102 views
Let $f:\mathbb Z^+\to B$ be defined by $f(n)=\frac{n^2+n}{2n^2+2n+1}$. Which of the following statements is correct?If $B=\mathbb Q$, then $f$ is bijective. If $B={q\in\m...
0 0 votes
1 1 answer
108
108 views
GO Classes asked May 15
108 views
Let $f:A\to B$ be a bijective function and let $I_A:A\to A$ and $I_B:B\to B$ denote the identity functions. Let $g:B\to A$ be any function. Consider the following stateme...
0 0 votes
1 1 answer
108
108 views
GO Classes asked May 15
108 views
Let $f:A\to B$ and $g:B\to C$ be functions, where $A,B,C$ are non-empty sets. Define $h=g\circ f:A\to C$. Consider the following statements:$p:$ If $g\circ f$ is one-to-o...
0 0 votes
1 1 answer
101
101 views
GO Classes asked May 15
101 views
Let $A=\{a_1,a_2,a_3,a_4,a_5\}$ and $B=\{b_1,b_2,b_3,b_4,b_5,b_6,b_7\}$. Find the number of injective functions $f:A\to B$ such that for every $i=1,2,3,4,5$, $f(a_i)\neq ...