Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °

You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

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

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 102,371

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.** **A number by itself is useful, but it is far more useful to know how accurate or certain that number is.**

**Online**

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

Given a set of n non-recurring objects,

, and a number k such that . Find words that fit in the following definition.a, A way of arranging all n objects (order matters, formula ).

b, A way of choosing AND arranging k out of the n objects (order matters, formula )

c, A way of choosing k out of the n objects (order does NOT matters, formula )

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 mentioned, repetition is not allowed.

P.S. Sorry for the older post, it's just an experiment. I forgot to put the formula tag in. Again, sorry.

*Last edited by phanthanhtom (2013-06-13 03:26:15)*

Offline

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 102,371

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.** **A number by itself is useful, but it is far more useful to know how accurate or certain that number is.**

**Online**

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

What do you mean? I don't know the formula!

*Last edited by phanthanhtom (2013-06-13 03:30:39)*

Offline

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 102,371

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.** **A number by itself is useful, but it is far more useful to know how accurate or certain that number is.**

**Online**

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

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

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 102,371

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.**

**Online**

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

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

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

And the formula for e is

Offline

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 102,371

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.**

**Online**

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

Thanks, but I stress again that I need the official NAME, not the formulae.

Offline

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 102,371

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.**

**Online**

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

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

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 102,371

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.**

**Online**

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

Yes you're right.

Offline

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

In other words, partial permutation <=> k < n

Offline

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 102,371

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.**

**Online**

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

Again, I am looking for alternative names. I finished reading that twelvefold Wikipedia article. Formulae enough.

Offline

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 102,371

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.**

**Online**

**phanthanhtom****Member**- Registered: 2012-06-22
- Posts: 289

Thanks

Offline

Pages: **1**