Skip to main content

All Questions

6 questions with no upvoted or accepted answers
3 votes
1 answer
852 views

Counting ordered integer partition permutations of max part size

Is there a better way to do this? The question as it was asked of me was to create an algorithm that counted the total number of ways an integer N could be partitioned into parts of size 6 or less. ...
maccelerated's user avatar
2 votes
0 answers
44 views

order of elements in a partition using Maple

I determined this whole partition but I just want to have the finer the partition for example: I have this ...
Chouria Ali's user avatar
0 votes
0 answers
47 views

Which of partitions of 5 correspond exclusively to even permutations?

I am ultimately want to prove that $A_{5}$ is simple and the first step in doing so is to: $(a)$ Write out all partitions of $5.$ Which of these correspond exclusively to even permutations? I was able ...
user avatar
0 votes
0 answers
88 views

How can we map a partition of $n$ to some permutation of [1,2, ... , n]?

Here is the question I was reading: Does every partition of n correspond to some permutation of [1,2, ... n]? And here is a statement in the answer given there that I want to use: If the partition is $...
user avatar
0 votes
0 answers
26 views

Making a group of $p$ people with $n$ available nationalities

Making a group of p people using m out of n available nationalities can be one of these two scenarios; $m \le p \le n$ or $m \le n \le p$. Using p,m, and n, how to evaluate the number of ways of ...
Hussain-Alqatari's user avatar
0 votes
0 answers
70 views

Number of ways to partition $\{1,2,3, \dots, N\}$ into tuples where the size of no tuple exceeds $3$.

While it seems to me that the general answer is not going to be a neat formula, I really only need this for $N=4$ and $N=5$. I'm getting $61$ and $321$ respectively, but I'm not sure. Please help.
user3460322's user avatar