Class 12th

Get insights from 12k questions on Class 12th, answered by students, alumni, and experts. You may also ask and answer any question you like about Class 12th

Follow Ask Question
12k

Questions

0

Discussions

25

Active Users

0

Followers

New answer posted

a year ago

0 Follower 8 Views

V
Vishal Baghel

Contributor-Level 10

 (i) On Z, * is defined by a * b = a − b.

It can be observed that 1 * 2 = 1 − 2 = 1 and 2 * 1 = 2 − 1 = 1.

∴1 * 2 ≠ 2 * 1; where 1, 2 ∈ Z

Hence, the operation * is not commutative.

Also we have:

(1 * 2) * 3 = (1 − 2) * 3 = −1 * 3 = −1 − 3 = −4

1 * (2 * 3) = 1 * (2 − 3) = 1 * −1 = 1 − (−1) = 2

∴(1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ Z

Hence, the operation * is not associative.

(ii) On Q, * is defined by a * b = ab + 1.

It is known that:

ab = ba & mn For E; a, b ∈ Q

⇒ ab + 1 = ba&nb

...more

New answer posted

a year ago

0 Follower 3 Views

V
Vishal Baghel

Contributor-Level 10

(i) On Z+, * is defined by a * b = a − b.

It is not a binary operation as the image of (1, 2) under * is 1 * 2 = 1 − 2= −1 ∉ Z+.

(ii) On Z+, * is defined by a * b = ab.

It is seen that for each a, b ∈ Z+, there is a unique element ab in Z+.

This means that * carries each pair (a, b) to a unique element a * b = ab in Z+.

Therefore, * is a binary operation.

(iii) On R, * is defined by a * b = ab2.

It is seen that for each a, b ∈ R, there is a unique element ab2 in R. 

This means that * carries each pair (a, b) to a unique element a * b = ab2 in R.

Therefore, * is a binary operation.

(iv) On Z+, * is defined by a * b = |a −

...more

New answer posted

a year ago

0 Follower 6 Views

V
Vishal Baghel

Contributor-Level 10

It is given that f:R−{−43}→R is defined as f(x)=4x3x−4

Let y be an arbitrary element of Range f.

Then, there exists x∈R−{−43} such that y=f(x)

⇒y=4x3x+4

⇒3xy+4y=4x let us define g: Range f→R−{−43}as,g(y)=4y4−3y

⇒x(4−3y)=4yNow,(gof)(x)=g(f(x))=g(4x3x+4)⇒x=4y4−3y=4(4x3x+4)4−3(4x3x+4)=16x12x+16−12x=16x16=xAnd,(fog)(y)=f(g(y))=f(4y4−3y)=4(4y4−3y)3(4y4−3y)+4=16y12y+16−12y=16y16=y∴gof=IR−(−43)and,fog=I_"Range,f"

Thus, g is the inverse of f i.e., f−1=g.

Hence, the inverse of f is the map g: Range f→R−{−43} which is given by

g(y)=4y4−3y

The correct answer is B.

New answer posted

a year ago

0 Follower 7 Views

V
Vishal Baghel

Contributor-Level 10

f:R→R is given as f (x)= (3−x∧3)∧ (1/3)

f (x)= (3−x3)13∴fof (x)=f (f (x))=f ( (3−x3)13)= [3− ( (3−x3)13)3]13= [3− (3−x3)]13= (x3)13=x∴fof (x)=x

The correct answer is C.

New answer posted

a year ago

0 Follower 13 Views

V
Vishal Baghel

Contributor-Level 10

Let f: X → Y be an invertible function. 

Then, there exists a function g: Y → X such that gof = IX and fog = IY. 

Here, f−1 = g. 

Now, gof = IX and fog = IY

⇒ f−1 of = IX and fof−1 = IY

Hence, f−1 : Y → X is invertible and f is the inverse of f−1 

i.e., (f−1)−1  = f.

New answer posted

a year ago

0 Follower 10 Views

V
Vishal Baghel

Contributor-Level 10

f(1)=a,f(2)b,and,f(3)=c

If we define g:{a,b,c}→{1,2,3}as,g(a)=1,g(b)=2,g(c)=3, then we have:

  (fog)(a)=f(g(a))=f(1)=a(fog)(b)=f(g(b))=f(2)=b(fog)(c)=f(g(c))=f(3)=cAnd(gof)(1)=g(f(1))=f(a)=1(gof)(2)=g(f(2))=f(b)=2(gof)(3)=g(f(3))=f(c)=3∴gof=IXand,fog=IYWhere,X={1,2,3},and,Y={a,b,c}.

Thus, the inverse of f exists and f−1=g.

∴f−1:{a,b,c}→{1,2,3} is given by,

f−1(a)=1,f−1(b)=2,f−1(c)=3

Let us now find the inverse of f−1 i.e., find the inverse of g.

If we define h:{1,2,3}→{a,b,c}as

h(1)=a,h(2)=b,h(3)=c , then we have

(goh)(1)=g(h(1))=g(a)=1(goh)(2)=g(h(2))=g(b)=2(goh)(3)=g(h(3))=g(c)=3And(hog)(a)=h(g(a))=h(1)=a(hog)(b)=h(g(b))=h(2)=b(hog)(c)=h(g(c))=h(3)=c∴goh=IXand,hog=IYWhere,X={1,2,3},and,Y={a,b,c}.

Thus, the inverse of g exists and g−1=h⇒(f−1)−1=h.

It can be noted that h=f.

Hence, (f−1)−1=f.

New answer posted

a year ago

0 Follower 4 Views

V
Vishal Baghel

Contributor-Level 10

Let f:X→Y be an invertible function.

Also, suppose f has two inverses (say g1 and g2 ).

Then, for all y ∈ Y, we have:

fog1 (y)=Iy (y)=fog2 (y)⇒f (g1 (y))=f (g2 (y))  [f is invertible => f is one-one]

⇒g1=g2  [g is one-one]

Hence, f has a unique inverse.

New answer posted

a year ago

0 Follower 31 Views

V
Vishal Baghel

Contributor-Level 10

f:R+→  [4, ∞) is given as f (x)=x2+4 .

One-one:

Let, f (x)=f (y).⇒x2+4=y2+4⇒x2=y2⇒x=y [as, x=y∈R]

∴f is a one-one function.

New answer posted

a year ago

0 Follower 29 Views

V
Vishal Baghel

Contributor-Level 10

f:R→R is given by,

f(x)=4x+3One−one:Let,f(x)=f(y).⇒4x+3=4y+3⇒4x=4y⇒x=y

∴ f is a one-one function.

Onto:

For,y∈R,let,y=4x+3.⇒x=y−34∈R

Therefore, for any y∈R , there exists x=y−34∈R such that

f(x)=f(y−34)=4(y−34)+3=y

∴ f is onto.

Thus, f is one-one and onto and therefore, f−1 exists.

Let us define g:R→R by g(x)=y−34

Now,(gof)(x)=g(f(x))=g(4x+3)=(4x+3)−34=x(fog)(y)=f(g(y))=f(y−34)=4(y−34)+3=y−3+3=y∴gof=fog=IR

Hence, f is invertible and the inverse of f is given by

f−1=g(y)=y−34

New answer posted

a year ago

0 Follower 43 Views

V
Vishal Baghel

Contributor-Level 10

f:[−1,1]→R is given as f(x)=xx+2

Let,f(x)=f(y).⇒xx+2=yy+2⇒xy+2x=xy+2y⇒2x=2y⇒x=y

∴ f is a one-one function.

It is clear that f:[−1,1]→ Range f is onto.

∴ f:[−1,1]→ Range f is one-one onto and therefore, the inverse of the function:

f:[−1,1]→ Range f exists.

Let g: Range f→[−1,1] be the inverse of f.

Let y be an arbitrary element of range f.

Since f:[−1,1]→ Range f is onto, we have:

⇒y=xx+2⇒xy+2y=x⇒x(1−y)=2y⇒x=2y1−y,y≠1g(y)=2y1−y,y≠1Now,(gof)(x)=g(f(x))=g(xx+2)=2(xx+2)1−xx+2=2xx+2−x=2x2=x(fog)(y)=f(g(y))=f(2y1−y)=2y(1−y)(2y1−y)+2=2y2y+2−2y=2y2=y∴gof=I−1,1,and,fog−IRange,f∴f−1=g∴f−1(y)=2y1−y,y≠1

Get authentic answers from experts, students and alumni that you won't find anywhere else

Sign Up on Shiksha

On Shiksha, get access to

  • 67k Colleges
  • 1.2k Exams
  • 718k Reviews
  • 1850k Answers

Share Your College Life Experience

×
×

This website uses Cookies and related technologies for the site to function correctly and securely, improve & personalise your browsing experience, analyse traffic, and support our marketing efforts and serve the Core Purpose. By continuing to browse the site, you agree to Privacy Policy and Cookie Policy.