As function is one-one and onto, out of 50 elements of domain set 17 elements are following restriction
So number of ways
As function is one-one and onto, out of 50 elements of domain set 17 elements are following restriction
So number of ways
Given,
Also given,
..... (1) For
From equation (1), when n = 2
Similarly,
(Already calculated earlier)
and
So,
defined as
and
Now
Domain of
And range of
Now,
for
\therefore
x \in ( - \infty , - 1) \cup (0,1)
{d \over {dx}}(fog(x))
is neither one-one nor onto.
Given,
and
For x = 1 and y = 1,
For x = 1, y = 2,
For x = 1, y = 3,
For x = 1, y = 4,
..... (1) Also given
This represent a G.P with first term = 29 and common ratio = 22 First term
..... (2) From equation (1),
From (1) and (2), we get
Comparing both sides we get,
\Rightarrow
f\left( {g\left( {{{{{(\alpha - 1)}^2}} \over 3}} \right)} \right) > f\left( {g\left( {\alpha - {5 \over 3}} \right)} \right)
\Rightarrow {{{{(\alpha - 1)}^2}} \over 3}
= (\alpha - 2)(\alpha - 3)
Given,
It means
and
are dependent on each other. But there is no condition on
, so
can be
. For
and we have to find how many functions possible which will satisfy the condition
Case 1 : When
then possible values of
and
which satisfy
is
and
. And
can be = 1, 2, 3, 4, 5, 6 Total possible functions
Case 2 : When
then possible values (1)
and
(2)
and
And
can be = 1, 2, 3, 4, 5, 6. Total functions
Case 3 : When
then (1)
and
(2)
and
(3)
and
And
can be = 1, 2, 3, 4, 5, 6 Total functions
Case 4 : When
then (1)
and
(2)
and
(3)
and
(4)
and
And
can be = 1, 2, 3, 4, 5 and 6 Total functions
Case 5 : When
then (1)
and
(2)
and
(3)
and
(4)
and
(5)
and
And
can be = 1, 2, 3, 4, 5 and 6 Total possible functions
Total functions from those 5 cases we get
defined as
, where is the maximum power of those primes p such that p divides a.
, Now,
is not one-one Now,
So, there does not exist any
such that
is not onto
First and last term, second and second last and so on are equal in magnitude but opposite in sign.
..... (i)
.... (ii)
OR
OR
..... (iii) From (i) and (ii)
..... (iv) From (iii)
(i)
..... (v) From (iv) and (v)
and