How Many Ways Can a Positive Integer Be Written as a Sum of Positive Integers?

  • Context: MHB 
  • Thread starter Thread starter hxthanh
  • Start date Start date
Click For Summary
SUMMARY

The discussion focuses on the methods for expressing a positive integer \( n \) as a sum of positive integers, both with and without considering permutations. When permutations are allowed, the number of ways to express \( n \) is \( 2^{n-1} \). For example, \( n = 4 \) yields 8 unique sums. However, when permutations are not allowed, the problem becomes significantly more complex, requiring advanced techniques such as recurrence relations, which were notably explored in the 1930s.

PREREQUISITES
  • Understanding of combinatorial mathematics
  • Familiarity with recurrence relations
  • Basic knowledge of integer partitions
  • Experience with mathematical proofs and problem-solving techniques
NEXT STEPS
  • Study integer partition theory in depth
  • Learn about recurrence relations and their applications in combinatorics
  • Explore the historical context of combinatorial problems, referencing works by Martin Gardner
  • Investigate algorithms for generating integer partitions without permutations
USEFUL FOR

Mathematicians, educators, and students interested in combinatorial mathematics, particularly those exploring integer partitions and advanced problem-solving techniques.

hxthanh
Messages
15
Reaction score
0
$\boxed 1$ How many ways writing positive integer $n\;$ as the sum of the positive integers different each pairs? (no permutation)

Example: $6=6=1+5=2+4=1+2+3 \quad $ (4 ways)

$\boxed 2$ How many ways writing positive integer $n\;$ as the sum of the positive integers? (no permutation)

Example: $\begin{align*} 6&=6\\ & =1+5 = 2+4 = 3+3 \\&= 1+1+4 =1+2+3 =2+2+2\\ &=1+1+1+3 =1+1+2+2 \\& =1+1+1+1+2 \\&=1+1+1+1+1+1 \end{align*}\quad $ (11 ways)
 
Mathematics news on Phys.org
Re: Write n=a+b+c+...


If permutations are allowed, the problem is elementary.

Consider a board n inches long.
Mark the board in one-inch intervals.

. . . . \underbrace{\square\!\square\!\square\!\square \cdots \square}_{n-1\text{ marks}}

At each mark, we have 2 choices: cut or do not cut.

Hence, there are 2^{n-1} possible decisions.

Therefore, there are 2^{n-1} possible addition problems.Example: n = 4
. . \begin{array}{c} 4 \\ 1+3, \;\; 2+2, \;\;3+1 \\ 1+1+2, \;\; 1+2+1, \;\; 2 +1+1 \\ 1+1+1+1+1 \end{array}\quad(2^3 = 8\text{ ways)}However, if permutations are not allowed,
. . the problem become very difficult.

Many years ago, my then-wife was in Special Education.
She asked me how many addition problems would total 5.
I did some scribbling and came up with the formula.
I proudly announced 2^4 = 16 problems and listed them.

Then she asked how many if permutations were not allowed.
I spent the rest of the weekend and got nowhere. .On Monday,
I gave the problem to my fellow math professors. .Within
weeks we had huge spreadsheets and vainly tried find the
underlying pattern.

After several months, I gave up and wrote to Martin Gardner.
He replied that the problem was solved in the 1930's (virtually
yesterday!) and gave me reference. .I finally found the book
at the Boston Public Library. .There is a recurrence relation,
but it was very complicated, being quadratic in form.

The notes are somewhere in my vast archives. .(My wife says
they are half-vast. . I think that's what she said.)

Good luck in your search.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
899
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
4K
Replies
1
Views
1K