You are not logged in.
Pages: 1
I'm having trouble fitting words into the following definitions.
Given a set of n non-recurring objects, S = {a1, a2, a3, ..., an}, and a number k such that 0 <= k <= n. Find words that fit in the following definition.
a, A way of arranging all n objects (order matters, formula n!).
b, A way of choosing AND arranging k out of the n objects (order matters, formula n!/k!)
c, A way of choosing k out of the n objects (order does NOT matters, formula n!/k!(n-k)!)
d, A way of choosing AND arranging k objects from S, repetition allowed, order matters.
e, A way of choosing k objects from S, repetition allowed, order does NOT matters.
Note: If not mention, repetition is not allowed.
P.S. I have no experience using maths formula on this forum, so I prefer not to do so. But I hope I can learn how to do so.
Offline
Hi;
You can use this site to do your latexing for you.
http://latex.codecogs.com/editor.php
I would think that for the rest of those you would consult your textbook. Is it the Rosen book?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Given a set of n non-recurring objects,
, and a number k such that . Find words that fit in the following definition.Last edited by phanthanhtom (2013-06-13 03:26:15)
Offline
For d) that is all you have?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
What do you mean? I don't know the formula!
Last edited by phanthanhtom (2013-06-13 03:30:39)
Offline
How many are being picked from S? n objects? 3 objects k - n objects?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
d. For example if k=5, then (a1, a2, a2, a3, a3) would be a solution (repetition allowed), and it would be different from, say, (a1, a2, a3, a2, a3).
e. The above 2 would be the same solution, as order doesn't matter.
Offline
Hi;
d, A way of choosing AND arranging k objects from S, repetition allowed, order matters.
Choosing k objects from n distinct objects with repetition and order matters is n ^ k
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
For k=3, n=5:
a. (a1, a2, a3, a4, a5) and (a1, a3, a4, a2, a5) are different solutions. All solutions contains all 5 objects.
b. (a1, a2, a3), (a1, a2, a4), (a1, a3, a2) are different solutions. (a1, a1, a4) is not, for repetition not allowed.
c. (a1, a2, a3) and (a2, a3, a5) are different solutions. (a1, a2, a3) and (a2, a3, a1) are the same. (a1, a3, a3) is not a solution.
I'm afraid I would be away now because it's late. I'll be back GMT 8:00 am. So I look for the answers then.
And I only need the words. I'm sure I know the formulae, just I don't have enough time.
Last edited by phanthanhtom (2013-06-13 03:50:35)
Offline
And the formula for e is
Offline
Hi;
You might want to take a look here when you have time.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Thanks, but I stress again that I need the official NAME, not the formulae.
Offline
Hi;
They are usually defined or named in terms of balls or objects in boxes or urns. I have never heard of anything else. That page is from Rota, it covers every type of combinatorics problem there is.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Thank you. The Vietnamese names for them roughly translates to:
A. permutation
B. partial permutation
C. combination
D. partial permutation with repetition
E. combination with repetition
I am looking for formal and better alternatives, for I translate by my knowledge all these names, and it would be really important for BIMC.
Offline
A partial permutation? Is that when you do not use all the elements of the set?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Yes you're right.
Offline
In other words, partial permutation <=> k < n
Offline
They are best done with exponential generating functions.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Again, I am looking for alternative names. I finished reading that twelvefold Wikipedia article. Formulae enough.
Offline
Okay, if I see anything different I will add it here.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Thanks
Offline
Pages: 1