MyQuestionIcon

1

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

Bijective Function

If nA = 5, ...

Question

If $n (A) = 5, n (B) = 3$ then the number of bijections from $A$ to $B$ is

A

15

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

B

125

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

C

243

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

D

0

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

Open in App

Solution

The correct option is D $0$
$n (A) \neq n (B) ∴ f; A \to B$ is not one-one.
$∴ f$ cant be a bijection.
no of bijections from $A$ to $B$ is zero

Suggest Corrections

thumbs-up

0

Similar questions

n (A) + n (B) = m

, then the number of possible bijections from

A

B

f : A \to B

is a bijective function and if n(A) = 5, then n(B) is equal to

n (A) = 3

n (B) = 5

then the number of non-injective mappings possible from

B

A

f : A \to B

is bijective function such that

n (A) = 10

n (B)

n (A) = 3, n (B) = 2

, then the number of surjections from

A

B

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Types of Functions

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Bijective Function

Standard XII Mathematics

Join BYJU'S Learning Program

CrossIcon