How many one-to-one functions f are possible?

[snipekiller]

Homework Statement

Suppose that |A| = n and |B| = m with n ≤ m. How many one-to-one functions f are possible with f: A → B?

Homework Equations

If |A| = |B| = m how many different bijections f: A → B are possible?
Answer: m!

The Attempt at a Solution

I really do not know how to start off the question. If someone can help me get started into this equation that would be great!

The relevant equation I did manage to get. but I do not know how to solve the problem when the size of A is not equal to the size of B.

 

[Dick]

Well, you know f is a bijection into the subset of B given by f(A). Now you just have to figure out the number of ways to choose a subset of B of size |A|.

 

[SteveL27]

Homework Statement

Suppose that |A| = n and |B| = m with n ≤ m. How many one-to-one functions f are possible with f: A → B?

Homework Equations

If |A| = |B| = m how many different bijections f: A → B are possible?
Answer: m!

The Attempt at a Solution

I really do not know how to start off the question. If someone can help me get started into this equation that would be great!

The relevant equation I did manage to get. but I do not know how to solve the problem when the size of A is not equal to the size of B.

Do you know how to compute the total number of functions from A to B? If you can do that, you can use the same type of reasoning for this problem, remembering that as you construct a function it must be 1-1.