That is a certain type of partition. There are ways to calculate them.

]]>I am new here.Really impressed with the combinations and permutations calculator. Would it be possible for someone to add a rule where if the elements are integers then results are only shown if the sum of the combinations/permutations add up to a given number.

Thanks bin anticipation.

Best regards,

dodgyg1

]]>You can see there that a permutations of n elements always contains n elements, and not less.

"permutations and combinations" refers to two related problems, both counting possibilities to select k distinct elements from a set of n elements, where for k-permutations the order of selection is taken into account, but for k-combinations it is ignored.

k can be less than n.

If egf's solve permutation problems and they solve this one is it not likely that this is a permutation problem?

If you need to see how to solve them please ask the question in Help Me. I will show you.

]]>You can call them variations and still use EGFs. I just cannot remember how to do that.

]]>Post #17 is similar to a mississippi problem, which is definitely a permutation.

I can't seem to calculate those using GFs.

Well of course you can not if you call it a variation. There are ogf's for combinations and egf's for permutations.

]]>I can't seem to calculate those using GFs.

]]>http://www.askamathematician.com/2010/0 … nt-matter/

You will notice that in this exact type of problem he calls it an arrangement or permutation.

Anyways, it is calculated in the same way.

]]>As you were taught, you try not to work on a problem that you do not already know the answer to. Remember back engineering? You work from the answer to the question, filling in the details.

Normally to do that I would have just counted them up first. But here MIF already does that with his program so you should use what to get the answer?

GF's of course!

]]>