You are not logged in.
Pages: 1
I'm not quite sure how to answer this question:
Let X and Y be sets with
and .Determine the number of functions f mapping X into Y.
Offline
With a mapping, we can't send an x to more than one y. So how many places are there for you to send x? And how many x's do you have to send?
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
That's the thing I'm not too sure. I thought it had something to do with the values n and m. I assume n suggests that there are n values in the set X and m values in set Y, then from there we find out how many functions could be mapped. Does that help or was that load of b*ll**ks!
Offline
Yes, that you definitely need to know.
A map is determined by where things get sent. Once you know how many places you can send things, you can pretty easily figure out how many maps their are. So how many places can you send an arbitrary element x in X?
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
I understand what you are saying about mapping, but I'm afraid that's all there is to that question.
Offline
Anyone any ideas?
Offline
Sometimes the best explanation of a problem is the answer itself. For this problem, its
There are m[sup]n[/sup] possible functions from a set with n elements to a set with m elements. Thats the answer; its your job now to reason out why it is so.
Last edited by JaneFairfax (2008-10-02 02:36:01)
Offline
I have asked twice now:
So how many places can you send an arbitrary element x in X?
If you can't answer that after some thought, then I suggest you go back over what the definition of a function is, in terms of relations.
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
I think JaneFairfax is going about this the right way because Ricky I don't think I can give you an answer to that question you are asking except that there are n elements in X that can be mapped to m elements in Y.
Offline
I don't think I can give you an answer to that question you are asking except that there are n elements in X that can be mapped to m elements in Y.
It seems you don't understand the question, but you do understand the answer. For how many places a single element in X can be sent, it does not matter how many elements there are in X. That has absolutely no bearing on the number of places that it can get sent. However, the number that is important here is the one you said: m. There are m places to send any element in X.
Now you have the answer for a single element of X. Now the next step: You can send an arbitrary element, call it x1, in X to m places. Now lets pick another element, x2, with x1 not equal to x2. How many places can x2 go?
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
i am not able to do this question as it is so difficult pleas help me....:(
Pages: 1