# Tagged Questions

Questions related to the different ways of expressing an integer as a sum of integers; or, questions related to the subdivision of a set into smaller disjoint sets; questions related to the subdivision of an interval into smaller intervals that intersect only at the endpoints.

1answer
168 views

1answer
52 views

1answer
31 views

### Counting number of balanced two-way partition of the set

Given a set with $2n$ elements, show that the number of balanced two-way partition of the set $$P(2n)=\frac{2n!}{2\times n!\times n!}$$ I'm getting is as P(2n)=${2n}\choose{n}$. But I'm getting ...
0answers
42 views

### Find a polynomial with evaluation equal to # of partitions of n into at most k parts

Fix a positive integer $k$. For positive integer $n$ let $p(n;\le k)$ denote the number of partitions of $n$ into at most $k$ parts, and let $p(0;\le k)=1$. (1) Show that there is a polynomial $P(x)$ ...
3answers
81 views

4answers
66 views

### What is a simple example that shows equivalence classes constitute a partition?

Can someone illustrate using a simple concrete example that the equivalence classes defined by $\sim$ constitute a partition of a set $A$?
1answer
28 views

### Writing a Sum of Partition Items in Combinatorial Form

For each partition $\lambda$ we can define $$n(\lambda) = \sum_{i \geq 1}(i-1)\lambda_i.$$ According to my book this is equivalent to n(\lambda)=\sum_{i ...
1answer
419 views

### On the inequality $\frac{1+p(1)+p(2) + \dots + p(n-1)}{p(n)} \leq \sqrt {2n}.$

For all positive integers $n$, $p(n)$ is the number of partitions of $n$ as the sum of positive integers (the partition numbers); e.g. $p(4)=5$ since $4=1+1+1+1=1+1+2=1+3=2+2=4.$ Prove ...
0answers
40 views

1answer
85 views

### Integer Partitions and distinguishable permutations

I'm not a mathematician but I'm faced with a problem where I can't find an answer, also because I do not know what I shall ask for: I have to deal with partitions of an integer k, only small values, ...
2answers
81 views

### Partition and Equivalence Relation: In $\mathbb{Z}$, let $m\sim n$ iff $m - n$ is a multiple of 10

Prof. Pinter's "A Book of Abstract Algebra" presents this exercise: Prove that each of the following is an equivalence relation on the indicated set. Then, describe the partition associated with ...
1answer
70 views

### Facing problem to understand the equivalence class concept.

Currently I am trying to understand the equivalence class from the Herstein's book. And I am facing problem to understand the concept and also can't understand the theorem given in the page number 8. ...
1answer
40 views

### Minimum number of partitions of a set given list of numbers that can't appear in the same partition

I wish to calculate the minimum number of partitions of a set required given a list of pairs of numbers that cannot appear together in the same partition. Example 1: S = [1,2,3,4,5,6]\\[5pt] \text{...