in Set Theory & Algebra closed by
445 views
0 votes
0 votes
closed with the note: duplicate: https://gateoverflow.in/170311/discrete-maths-functions

The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pth element of set B are _________.

in Set Theory & Algebra closed by
445 views

2 Comments

48.??
0
0
Given ans is 35
0
0

Related questions

0 votes
0 votes
1 answer
1
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true