How many one-to-one functions are there from a set with m elements to a set with n elements, where msn?

Step-by-step explanation:

Given that there are two sets one with m elements and other with n elements and m<n.

If there is a one to one correspondence from first set to second set, each element in first set will have a unique image, different from the images of other elements inthe set.

I element can be mapped in n ways second in n-1 ways .... and last one in n-m+1 ways.

Hence no of ways = nPm

=

1. is 4 and 2. is 3

step-by-step explanation:

so if you look at the first one you see that 1 is to 4 and 2 is to 8 and so on, so you can see for every 1 there is a times 4 so if it were 3 then it would be 3*4 and it is 12

for number 2 it is 3 because 1 is to 3 and 2 is to 6 so for every 1 there is 3 so if it were 3 then there would be 3*3 = 9

answerim :

n

step-by-step explanation:

im not sure but my dad knows