Ncert Solutions Maths class 12th

It is given that:

$f:W\to W$ is defined as $f\left(n\right)=\{\begin{array}{l}n-1,if.n,odd\\ n+1,if.n,even\end{array}$

One-one:

Let, $f\left(n\right)=f\left(m\right).$

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

$\Rightarrow n-m=2$

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

$\therefore$ Both n and m must be either odd or even.

Now, if both n and m are odd, then we have:

$f\left(n\right)=f\left(m\right)\Rightarrow n-1=m-1\Rightarrow n=m$

Again, if both n and m are even, then we have:

$f\left(n\right)=f\left(m\right)\Rightarrow n+1=m+1\Rightarrow n=m$

$\therefore f$ is one-one.

It is clear that any odd number 2r+1 in co-domain N is the image of 2r in domain N and any even 2r in co-domain N is the image of 2r+1 in domain N.

$\therefore f$ is onto.

Hence, f is an invertible function.

Let us define $g:W\to W$ as:

$g\left(m\right)=\{\begin{array}{l}m+1,if.n,even\\ m-1,if.n,odd\end{array}$

Now, when n is odd:

$gof\left(n\right)=g\left(f\left(n\right)\right)=g\left(n-1\right)=n-1+1=n$

And, when n is even:

$gof\left(n\right)=g\left(f\left(n\right)\right)=g\left(n+1\right)=n+1-1=n$

Similarly, when m is odd:

$fog\left(m\right)=f\left(g\left(m\right)\right)=f\left(m-1\right)=m-1+1=m$

When m is even:

$\begin{array}{l}fog\left(m\right)=f\left(g\left(m\right)\right)=f\left(m+1\right)=m+1-1=m\\ \therefore gof=I_W,and,fog=I_W\end{array}$

Thus, f is invertible and the inverse of f is given by $f^{-1}=g$ , which is the same as f.

Hence, the inverse of f is f itself.

A = N * N

* is a binary operation on A and is defined by:

(a, b) * (c, d) = (a + c, b + d)

Let (a, b), (c, d) ∈ A

Then, a, b, c, d ∈ N

We have:

(a, b) * (c, d) = (a + c, b + d)

(c, d) * (a, b) = (c + a, d + b) = (a + c, b + d) 

[Addition is commutative in the set of natural numbers]

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

Therefore, the operation * is commutative.

Now, let (a, b), (c, d), (e, f) ∈A

Then, a, b, c, d, e, f ∈ N

We have:

$\begin{array}{l}\left(\left(a,b\right).\left(c,d\right)\right).\left(e,f\right)=\left(a+c,b+d\right).\left(e,f\right)=\left(a+c+e,b+d+f\right)\\ \left(a,b\right).\left(\left(c,d\right).\left(e,f\right)\right)=\left(a,b\right).\left(c+e,d+f\right)=\left(a+c+e,b+d+f\right)\\ \therefore \left(\left(a,b\right).\left(c,d\right)\right).\left(e,f\right)=\left(a,b\right).\left(\left(c,d\right).\left(e,f\right)\right)\end{array}$

Therefore, the operation* is associative.

An element $e=\left(e_1,e_2\right)$ will be an identity element for the operation* if

$a*e=a=e*a\forall a=\left(a_1,a_2\right)\in A$

$i.e.,\left(a_1+e_1,a_2+e_2\right)=\left(a_1,a_2\right)=\left(e_1+a_1,e_2+a_2\right)$ which is not true for any element in A.

Therefore, the operation* does not have any identity element.

Which is not true for any element in A.

Therefore, the operation * does not have any identity element.

(i) On Q the operation* is defined as a*b=a-b.

It can be observed that:

$\begin{array}{l}\frac{1}{2}.\frac{1}{3}=\frac{1}{2}-\frac{1}{3}=\frac{3-2}{6}=\frac{1}{6}"and"\frac{1}{3}.\frac{1}{2}=\frac{1}{3}-\frac{1}{2}=\frac{2-3}{6}=\frac{-1}{6}\\ \therefore \frac{1}{2}.\frac{1}{3}\ne \frac{1}{3}.\frac{1}{2}where,\frac{1}{2},\frac{1}{3}\in Q\end{array}$

Thus, the operation* is not commutative.

It can also be observed that:

$\begin{array}{l}\left(\frac{1}{2}.\frac{1}{3}\right).\frac{1}{4}=\left(\frac{1}{2}-\frac{1}{3}\right).\frac{1}{4}=\frac{1}{6}.\frac{1}{4}=\frac{1}{6}-\frac{1}{4}=\frac{2-3}{12}=\frac{-1}{12}\\ \frac{1}{2}.\left(\frac{1}{3}.\frac{1}{4}\right)=\frac{1}{2}.\left(\frac{1}{3}-\frac{1}{4}\right)=\frac{1}{2}.\frac{1}{12}=\frac{1}{2}-\frac{1}{12}=\frac{6-1}{12}=\frac{5}{12}\\ \therefore \left(\frac{1}{2}.\frac{1}{3}\right).\frac{1}{4}\ne \frac{1}{2}.\left(\frac{1}{3}.\frac{1}{4}\right)where,\frac{1}{2},\frac{1}{3},\frac{1}{4}\in Q\end{array}$

Thus, the operation* is not associative.

(ii) On Q the operation* is defined as a*b=a²+b.

For $a,b\in Q$ , we have:

$\begin{array}{l}a.b=a^2+b^2=b^2+a^2=b.a\\ \therefore a*b=b*a\end{array}$

Thus, the operation* is commutative.

It can be observed that:

$\begin{array}{l}\left(1*2\right)*3=\left(12+22\right)*3=\left(1+4\right)*3=5*3=52+32=25+9=34\\ 1*\left(2*3\right)=1*\left(22+32\right)=1*\left(4+9\right)=1*13=12+132=1+169=170\\ \therefore \left(1*2\right)*3\ne 1*\left(2*3\right),where,1,2,3\in Q\end{array}$

Thus, the operation* is not commutative.

(iii) On Q the operation* is defined as a*b=a+ab.

It can be observed that:

$\begin{array}{l}1.2=1+1*2=1+2=3\\ 2.1=2+2*1=2+2=4\\ \therefore 1.2\ne 2.1,where,1,2\in Q\end{array}$

Thus, the operation* is not commutative.

It can also be observed that:

$\begin{array}{l}\left(1.2\right).3=\left(1+1*2\right).3=3.3=3+3*3=3+9=12\\ 1.\left(2.3\right)=1.\left(2+2*3\right)=1+1*8=9\\ \therefore \left(1.2\right).3\ne 1.\left(2.3\right),where,1,2,3\in Q\end{array}$

Thus, the operation* is not associative.

(iv) On Q the operation* is defined as a*b=(a-b)²

For $a,b\in Q$ , we have:

$\begin{array}{l}a*b={\left(a-b\right)}^2\\ b*a={\left(b-a\right)}^2={\left[-\left(a-b\right)\right]}^2={\left(a-b\right)}^2\\ \therefore a*b=b*a\end{array}$

Thus, the operation* is commutative.

It can be observed that:

$\begin{array}{l}\left(1.2\right).3={\left(1.2\right)}^2.3={\left(-1\right)}^2.3=1.3={\left(1.3\right)}^2={\left(-2\right)}^2=4\\ 1.\left(2.3\right)=1.{\left(2.3\right)}^2=1.{\left(-1\right)}^2=1.1={\left(1.1\right)}^2=0\\ \therefore \left(1.2\right).3\ne 1.\left(2.3\right),where,1,2,3\in Q\end{array}$

Thus, the operation* is not associative.

(v) On Q the operation* is defined as a.b=ab/4

For $a,b\in Q$ , we have:

$\begin{array}{l}a.b=\frac{ab}{4}=b\frac{a}{4}=b.a\\ \therefore a*b=b*a\end{array}$

Thus, the operation* is commutative.

For $a,b,c\in Q$ , we have:

$\begin{array}{l}\left(a.b\right).c=\frac{ab}{4}.c=\frac{\frac{ab}{4}.c}{4}=\frac{abc}{16}\\ a.\left(b.c\right)=a.b\frac{c}{4}=\frac{a.\frac{bc}{4}}{4}=\frac{abc}{16}\\ =\therefore \left(a*b\right)*c\ne a*\left(b*c\right)\end{array}$