Ncert Solutions Maths class 12th

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

  • 2.5k

    Questions

  • 0

    Discussions

  • 0

    Active Users

  • 65

    Followers

Have a question about Ncert Solutions Maths class 12th? Ask our experts

Ask Your Question

Keep it short & simple. Type complete word. Avoid abusive language.

New answer posted•a year ago
S
a year ago

Since every set is a subset of itself, ARA for all A ∈ P (X).

∴R is reflexive.

Let ARB ⇒ A ⊂ B.

This cannot be implied to B ⊂ A.

For instance, if A = {1, 2} and B = {1, 2, 3}, then it cannot be implied that B is related to A.

∴ R is not symmetric.

Further, if ARB and BRC, then A ⊂ B and B ⊂ C.

⇒ A ⊂ C

⇒

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

Define f:Ν→Ν by

f (x)=x+1

And,  g:Ν→Ν by,

g (x) {x−1if, x>11f, x=1}

We first show that g is not onto.

For this, consider element 1 in co-domain N. it is clear that this element is not an image of any of the elements in domain.

∴f is not onto.

Now,  gof:Ν→Ν is defined by,

gof (x)=g (f (x))=g (x+1)= (x+1)−1 [x, inΝ=> (x+1)>1]=x

Then, it is clear that for y∈Ν , there exists

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

Define f:N→Z as f(x) and g:Z→Z as g(x)=|x|

We first show that g is not injective.

It can be observed that:

g(−1)=|−1|=1g(1)=|1|=1∴g(−1)=g(1),but,−1≠1

∴g is not injective.

Now, gof:N→Z is defined as

gof(x)=y(f(x))=y(x)=|x|

Let x,y∈N such that gof(x)−gof(y)

⇒|x|=|y|

Since x,y∈N , both are positive.

∴|x|=|y|⇒x=y

Hence, gof is injective

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

f: R → R is given as f (x) = x3.

Suppose f (x) = f (y), where x, y ∈ R.

⇒ x3 = y3  … (1)

Now, we need to show that x = y.

Suppose x ≠ y, their cubes will also not be equal.

⇒ x3 ≠ y3

However, this will be a contradiction to (1).

∴ x = y

Hence, f is injective.

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

It is given that f:R→{x∈R:−1<x<1} is defined as f(x)=x1+|x|,x∈R.

Suppose f(x)=f(y) , where x,y∈R.

⇒x1+x=y1−y⇒2xy=x−y

Since x is positive and y is negative:

x>y⇒x−y>0

But, 2xy is negative.

Then, 2xy≠x−y .

Thus, the case of x being positive and y being negative can be ruled out.

Under a similar argument, x being negative and y being positive can als

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

It is given that f:R→R is defined as f (x)=x2−3x+2.

f (f (x))=f (x2−3x+2)= (x2+3x+2)2−3 (x2−3x+2)+2=x4+9x2+4−6x2−12x+4x2−3x2+9x−6+2=x4−6x2+10x2−3x

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

It is given that:

f:W→W is defined as f(n)={n−1,if.n,oddn+1,if.n,even

One-one:

Let, f(n)=f(m).

It can be observed that if n is odd and m is even, then we will have n-1=m+1.

⇒n−m=2

However, the possibility of n being even and m being odd can also be ignored under a similar argument.

∴ Both n and m must be either odd or even.

Now, if both n

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

It is given that f:R→R is defined as f(x)=10x+7.

One-one:

Let,f(x)=f(y),where,x,y∈R⇒10x+7=10y+7⇒x=y

∴f is a one-one function.

Onto:

For,y∈R,let,y=10x+7⇒x=y−710∈R

Therefore, for any y∈R ,there exists x=y−710∈R

Such that

f(x)=f(y−710)=10(y−710)+7=y−7+7=y

∴f is onto.

Therefore, f is one-one and onto.

Thus, f is an invertible function.

Let us define g:R→R as g(y)=y−710

Now, we have

gof(x)=g(f(x))=g(10x+7)=(10x+7)−710=10x10=10Andfog(y)=f(g(y))=f(y−710)=10(y−710)+7=y−7+7=y

Hence, the required function

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

On N, the operation * is defined as a * b = a3 + b3.

For, a, b, ∈ N, we have:

a * b =  a3 + b3 = b3 + a3  = b * a [Addition is commutative in N]

Therefore, the operation * is commutative.

It can be observed that:

  (1*2)*3 = (13+23)*3 = 9 * 3 = 93 + 33 = 729 + 27 = 756

A

...Read more

Thumbs Up IconUpvote Thumbs Down Icon
New answer posted•a year ago
S
a year ago

(i) Define an operation * on N as:

a * b = a + b  a, b ∈ N

Then, in particular, for b = a = 3, we have:

3 * 3 = 3 + 3 = 6 ≠ 3

Therefore, statement (i) is false.

(ii) R.H.S. = (c * b) * a

= (b * c) * a [* is commutative]

= a * (b * c) [Again, as * is commutative]

= L.H.S.

∴ a * (b * c) = (c * b) * a

The

...Read more

Thumbs Up IconUpvote Thumbs Down Icon