Let A -1-2-3-4-5 and f - A - A be an into function such that f i - i - i - A then number of such functions f areA- 1024B- 904C- 980D- 984

The correct option is C 980Total number of functions for which f(i) ≠ i =4^5 and number of onto functions in which f(i) ≠ i =44 ⇒ required numbers of function ...

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Byju's Answer

Standard XII

Mathematics

Numerically Greatest Term

Let A =1,2,3,...

Question

Let A = {1, 2, 3, 4, 5} and $f : A \to A$ be an into function such that $f (i) \neq i \forall i \in A$ then number of such functions f are

1024

No worries! We‘ve got your back. Try BYJU‘S free classes today!

904

No worries! We‘ve got your back. Try BYJU‘S free classes today!

984

No worries! We‘ve got your back. Try BYJU‘S free classes today!

980

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

The correct option is D 980
Total number of functions for which $f (i) \neq i = 4^{5}$
and number of onto functions in which $f (i) \neq i = 44$
$\Rightarrow$ required numbers of functions = 980

Suggest Corrections

Similar questions

Q. Let

A = {1, 2, 3, 4, 5}

and

f : A \to A

be an into function such that

f (i) \neq i, \forall i \in A,

then number of such functions

f

are

Given a function

f : A \to B

; where

A = {1, 2, 3, 4, 5}

and

B = {6, 7, 8}

The number of mappings of

g (x) : B \to A

such that

g (i) \leq g (j)

whenever

i < j

Q. Let

A = {a, e, i, o, u}

and

B = {m, y, g, h, n, s}

. If

f : A \to B

is a function, then the maximum number of such functions possible are

Q. Let

A = {1, 3, 5, 7},

B = {2, 4, 6, 8}

and

f : A \to B .

Then number of functions

f

such that

f (i) \neq i + 1, \forall i = 1, 3, 5, 7

Q. Consider the set of all functions f : (0,1, 2014} {0.1, ....2014}

\to

such that f(f(i)) = i, for all 0

\leq

\leq

2014. Consider the following statements: P: For each such function it must be the case that for every i, f(i) = i. Q: For each such function it must be the case that for some i, f(i) =i. R : Each such function must be onto. Which one of the following is CORRECT?

Join BYJU'S Learning Program

Let A = {1, 2, 3, 4, 5} and f:A→A be an into function such that f(i)≠i∀i∈A then number of such functions f are

The correct option is D 980Total number of functions for which f(i)≠i=45 and number of onto functions in which f(i)≠i=44 ⇒ required numbers of functions = 980

Let A = {1, 2, 3, 4, 5} and $f : A \to A$ be an into function such that $f (i) \neq i \forall i \in A$ then number of such functions f are

The correct option is D 980
Total number of functions for which $f (i) \neq i = 4^{5}$
and number of onto functions in which $f (i) \neq i = 44$
$\Rightarrow$ required numbers of functions = 980