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.

learn more… | top users | synonyms

1
vote
1answer
28 views

Jee Main 2015 Question. Probabilty

If $12$ identical balls are to be placed in $3$ identical boxes, then the probability that one of the boxes contains exactly $3$ balls is: (1) $22 \times(\frac{1}{3})^{11}$ (2) $\frac{55}{3} \times ...
0
votes
0answers
21 views

Exponential generating function of partitions of set [n]

Find the exponential generating function of the partitions of the set [n], all of whose classes have a prime number of elements. The only thing I came up with was $$\sum\limits_{\textrm{t prime}} = ...
1
vote
0answers
22 views

Counting problem of combinations of symmetric matrix.

Given, a symmetric $n*n$ matrix $G$ with 0,1 entries. Each row of has same number of 1. $G$ is arranged in a certain order using a rule. The rule is described below- $G$ is partitioned in to two sub ...
0
votes
0answers
15 views

Determine the number of partition of 20 into at most 5 parts.

Im stuck on these questions, I can kind of compute them on maxima, but I have to figure out why and how to get to a particular generating function or method. Determine the number of partition of 20 ...
1
vote
0answers
20 views

Notation for the set of all integer partitions

I'm working on a project that involves that set $P = \{\{n_1, \ldots, n_k\} \mid k \in \mathbb{N}, n_i \in \mathbb{N} \text{ and } n_1 + \cdots +n_k = n\}$ of all integer partitions of a number $n$. ...
2
votes
0answers
17 views

Enumerate k part of n (and keep the list) [on hold]

I'm starting to understand the problem and how it is resolve. I do understand the n-1 and k-1 part whereas ...
1
vote
1answer
48 views

How many solutions of equation

How many solutions of equation $x_1+x_2+x_3+x_4=n$ in $N_0$ such that $x_1\leq x_2\leq x_3 \leq x_4$? I found solutions of $x_1+x_2+x_3=n$ in $N_0$ , $x_1\leq x_2\leq x_3 $ in the following way : ...
3
votes
1answer
62 views

Introduction to proofs: proving a set is a partition.

I've been really trying to understand how some of these proofs work; I've spent a majority of my time studying the material for this class, but I'm still performing poorly in it. It doesn't help that ...
0
votes
1answer
17 views

Number of ways to build a collection of numbers where $sum = k$, each $0 < n_i <= d_i$ for some corresponding $d_i$, and sum of all $d_i >= k$

I apologize for any (mis|ab)use of notation since I'm not a mathematician. My background is software engineering and computer science. I ran into this problem while trying to figure out the ...
5
votes
0answers
81 views

The smallest non-zero integer $c$ such that $\sum\limits_{n=1}^m\pm(x+n)^6 = c$?

We have the neat equalities, I. Group 1 For $k=2,3,4,5,\dots$ $$\sum_{n=1}^{2^k}\epsilon_n(x+n)^k = 2^{\frac{k(k-1)}{2}}k! = 4,\;48,\;1536,\;\color{brown}{122880},\dots$$ for appropriate ...
3
votes
1answer
55 views

Partition problem for consecutive $k$th powers with equal sums (another family)

This is the partition problem as applied to a special set, namely the first $n$ $k$th powers. Assume the notation, $$[a_1,a_2,\dots,a_n]^k = a_1^k+a_2^k+\dots+a_n^k$$ I. Family 1 The following ...
0
votes
0answers
12 views

On t-core partitions

How exactly can one define what is known as a t-core partition? I know (vaguely) that it involves the definition of what is known as "Hook numbers". Anyone cares to provide a link or explain it?
3
votes
4answers
26 views

Number of sequences formed of $k$ pairwise disjoint subsets of a set of $n$ elements is $(k+1)^n$.

Let $S=\{1,2,\dots,n\}$ and $P(S)$ the family of the $2^n$ subsets of $S$. Prove that the number of sequences $(S_1,S_2, \dots, S_k )$ formed by the subsets of $S$ that verify that $S_i \cap S_j = ...
1
vote
0answers
27 views

Terminology: Opposite of “refinement”

Let A be a partition of a set, and B a refinement of A. Fill in the blanks: A is a __________ of B. I know that A is coarser than B, but how does one turn that into a noun?
1
vote
2answers
55 views

Sums of Consecutive Cubes (Trouble Interpreting Question)

Show that it is possible to divide the set of the first twelve cubes $\left(1^3,2^3,\ldots,12^3\right)$ into two sets of size six with equal sums. Any suggestions on what techniques should be used to ...
0
votes
2answers
22 views

Proving a family of sets is a partition of the set of integers.

I am trying to show that for $E_n = \{10n, 10n + 1, 10n + 2 . . . , 10n + 9\}$, $\{E_n\}$, $n ∈Z$ is a partition of $ Z$. Should this be broken down into cases or is there a more general way to ...
2
votes
0answers
44 views

Recurrence relation / recursive formula / closed formula for partition numbers (1,2,3,5,7,11,15,22,30,42,…)

I have already read this: Number partition - prove recursive formula But the formula from the above link requires a parameter k which is the required number of ...
0
votes
0answers
27 views

dot diagram prove

I have to prove theorems using dot diagrams. a.- $P_n(k) = p_n(k-n)$ b.- $p_n(k) = p_{n-1}(k) + p_n(k-n)$ c.- The number $P_n(k)$ of partitions of $k$ into exactly $n$ parts is equal to the number ...
3
votes
0answers
70 views

Elementary proof of Ramanujan's “most beautiful identity”

Ramanujan presented many identities, Hardy chose one which for him represented the best of Ramanujan. There are many proofs for this identity. (for example, H. H. Chan’s proof, M. Hirschhorn's ...
1
vote
0answers
18 views

Find largest regions bounded by a set of planes

Suppose we are given a set of planes that partition the unit cube into a large number of regions. Is there a computationally efficient way to find the region with the largest volume?
0
votes
0answers
43 views

Proof of Ramanujan's Identities of Euler's Function

Consider Euler's Function defined as (and not to be confused with the totient!) $$ \phi(x) = (1-x)(1 - x^2) (1 - x^3 ) .... = \prod_{i=1}^{\infty} \left[(1 - x)^i \right] = (1;x)_{\infty}$$ ...
0
votes
1answer
32 views

Counting unordered partitions on nested concentric disks

The idea is to think of each layer outside of the [core] as a rotatable disk and then only count a single member from each of the resulting equivalence classes, which I think can be done by requiring ...
1
vote
1answer
54 views

Sample, randomly & uniformly the partitioning of $n$ objects into $K$ groups

I wish to sample randomly and uniformly from the set of partitions of $n$ objects into $K$ groups where the number to be assigned to each group, $n_k$ ($k = 1, 2, \dots, K$) is known. I know that the ...
1
vote
1answer
46 views

Partitioning a set to get a sum

I have a set of numbers: 2,2,4,4,4,4,4,4,6,6,6,6,6,6 I want to enumerate the possible ways to partition this set into 4 groups, each of which sum to 16. How can I approach this short of brute force? ...
2
votes
0answers
22 views

Link between partition function and ordered partition function

The partition function $p(n)$ measures the number of partitions of $n$, or the number of ways in which natural numbers can be summed to produce $n$, without regard to order. For example, the ...
1
vote
1answer
28 views

Generating function for set partitions

Let $k$ be fixed. For every $n$ denote by $p_{\leq k}(n)$ the number of partitions of the integer $n$, for which each part is at most $k$. a). Compute $p_{\leq 3}(5)$ b). Compute the generating ...
3
votes
0answers
46 views

Counting the number of partitions that are a distance d away from a fixed partition.

Given a positive integer $N \in \mathbb{Z}^{\geq 0}$ let $Partitions(N)$ denote the set of all partitions of $N$, where a tuple $\left(f_1,\ldots,f_N \right)$ is a partition of $N$ if $\sum_{i=1}^N ...
0
votes
0answers
17 views

Can I partition a non-separable set?

This question flashed in my mind, as I was studying quotient partition of a set. Is there any non-separability condition for which a topological set cannot be partitioned? Particularly, I tried ...
0
votes
1answer
47 views

Prove that A001399 == A069905

While solving PE and reading SICP I found, that there are two problems, that produce the same OEIS sequence: http://oeis.org/A001399 is a number of partitions of n into at most 3 parts ...
0
votes
0answers
47 views

Prove; regarding partitions and refinements

If $ f $ is a bounded function, then for every $ \epsilon >0 $ there exists a partition of a real interval $ X $ such that if $ Y $ is a refinement of $ X $. Why is this true?
0
votes
2answers
53 views

Prove: Partitions and refinements

Problem: Let $ R $ be the set of partitions of a real interval. Then for all elements in $ R $, every pair of elements has an upper bound. I am having trouble structuring the proof; and intuitively ...
1
vote
1answer
30 views

A fast algorithm for a simple multi-objective minimization?

I have a set $S$ consists of n (arbitrary) integer numbers which I want to partition into $k$ subsets $S_i$ each of size $\frac{n}{k}$ (assume $k$ divides $n$). Let $A$ be the arithmetic mean of ...
0
votes
0answers
33 views

Generalization of Catalan numbers

I am looking for some kind of function describing the number of non-crossing partitions similar to those described by the Catalan numbers. Let's say $C_3$ would be the third Catalan number. $C_3=5$ ...
0
votes
1answer
15 views

Counting resticted partitions of a multiset with additional restrictions

Say I have some multiset of integers, for example $M1=\{6,6,4,4,4,2,2\}$. I have a second multiset that consists of some set of valid sums derived from picking without replacement from $M1$, say for ...
1
vote
0answers
30 views

Does Euler's recurrence relation for partitions imply that the partition function grows exponentially

Can one, just by manipulating the series, demonstrate that the partition function must be growing exponentially or at least that it is unbounded by any polynomial? If so, then how would it be done. ...
1
vote
0answers
17 views

What is wrong with this “inference” about partitions?

Given that: $p(n)=p(n-1)+p(n-2)-p(n-5)-p(n-7)+⋯$ Why can one not state: $p(n)≥p(n-1)+p(n-2)-p(n-5)-p(n-7)$ Here is the logic: the subsequent 2 terms of the relation are additive and the 2 ...
1
vote
0answers
23 views

Famous Arithmetic property of lotteries - restricted partition of integer into exactly k distinct parts between a given set

I would like to find a complete explanation regarding a famous arithmetic property of lotteries : Let´s say a friend of us is a regular player of a lottery where 5 numbers are taken from a box ...
1
vote
0answers
21 views

Determining probabilities of set of independent experiments from probability of different subsets?

I have a population C of candidates C1..Cn An event will occur to Ci with unknown probability Pi (Pi are independent) The population is divided into disjoint sets S1..Sm For each sub set Si, P(Si) is ...
-1
votes
1answer
51 views

What is the difference between decomposing a number and partitioning a number?

I see that the question has been answered for SETS in "The Decomposition VS. The Partition of a set" but I would like good definitions that distinguish between these terms when used for NUMBERS. I ...
1
vote
0answers
87 views

Is every integer $\geq5$ the sum of two primes and a power of a prime?

Is every integer $\geq5$ the sum of two primes and a power of a prime (where $1$ is included in the prime powers)? I don't really expect someone to prove this here, but I wonder if the question has ...
1
vote
1answer
61 views

Number of Partitioning a deck with m cards in n types into n-element sets.

For exsample, There are 2cards in 3type. AA,BB,CC. Partition 6cards into 2 3-element sets. [AAB,BCC],[AAC,BBC],[ABB,ACC],[ABC,ABC],... 4 ways or Partition 6cards into 3 2-element sets. ...
0
votes
1answer
28 views

Partitioning elements into sets

How many ways are there to partition $n$ unique elements into $2$ sets? What about for $k$ sets? I am specifically interested in how to calculate this for varying values of $n$. Moreover, what if ...
0
votes
0answers
32 views

the number of ways a planar graph can be partitioned

i have a connected planar graph to cut into k parts and want to know how many possible solutions there are. it clearly depends on the shape of the graph since nodes all in a row cannot be partitioned ...
1
vote
1answer
39 views

Solving the equations $x_1= 4 x_2$ and $x_3= 5 x_2$, with the sum of all three being $150$

Here is the problem. A set X is partitioned into subsets x1, x2, and x3. The number of elements in x1 is 4 times the number in x2. And the number in x3 is 5 times the number in x2. If n(x)=150, ...
2
votes
2answers
56 views

What is the number $p(n)$ of partitions of an abundant number $n$ into distinct, proper divisors of $n$?

For lack of a better symbol, $p_{\sigma\tau}(n)$ (feel free to suggest something better). For example, $p_{\sigma\tau}(12) \geq 2$ since $12 = 1 + 2 + 3 + 6 = 2 + 4 + 6$. Of course if $n$ is ...
0
votes
1answer
87 views

Generating Functions of Partitions?

Show that $2(1-x)^{-3} [(1-x)^{-3} + (1+x)^{-3}]$ is the generating function for the number of ways to toss $r$ identical dice and obtain an even sum. Workings: I'm not too sure on this problem. ...
2
votes
2answers
51 views

how interpret this partition identity?

use the symbol $P(N)$ to denote the set of all partitions of a positive integer $N$ and denote by $P_k$ the number of occurrences of $k$ in the partition $P \in P(N)$, so that $$ N = \sum kP_k $$ by ...
2
votes
0answers
38 views

how to count possible planar bipartitions?

i want to find out what small fraction of a solution space a metaheuristic search is actually covering. this case comes down to the number of possible bipartitions for a non-bipartite, undirected ...
2
votes
1answer
81 views

How to find the restricted partition of n into k *distincts* parts between a finite set [1;r]?

It seems to be an opened question. Indeed, it is easy to find: the number of partitions of n into k distinct parts the number of partitions of n into k parts the number of partitions of n into k ...
1
vote
0answers
32 views

How to partition into more than two subsets

Given a set $A$ of numbers and the number of desired subsets, $n$, how can I divide the numbers in set $A$ into $n$ subsets where each number in $A$ is used in one and only one subset and the sum of ...