The Gateway to Computer Science Excellence
0 votes
51 views

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 pthelement of set B are _________.

in Combinatory by Veteran (119k points)
closed by | 51 views
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
50,737 questions
57,390 answers
198,586 comments
105,437 users