How many ways a number can be written as components sum?

Click For Summary
SUMMARY

The discussion focuses on the mathematical problem of determining how many ways a positive integer can be expressed as a sum of its components, specifically numbers less than itself. For instance, the number 5 can be represented in 6 distinct ways, while the number 6 has 10 representations. This exploration is rooted in partition theory, which deals with the ways of writing numbers as sums of other numbers. The participants question whether partition theory also encompasses sums of products, although the primary focus remains on additive representations.

PREREQUISITES
  • Understanding of positive integers and their properties
  • Familiarity with partition theory in number theory
  • Basic knowledge of combinatorial mathematics
  • Ability to analyze mathematical representations and combinations
NEXT STEPS
  • Research the principles of partition theory in depth
  • Explore combinatorial techniques for counting representations of integers
  • Learn about sums of products and their relation to partition theory
  • Investigate algorithms for computing integer partitions
USEFUL FOR

Mathematicians, students of number theory, and anyone interested in combinatorial mathematics and integer partitions will benefit from this discussion.

Adel Makram
Messages
632
Reaction score
15
If we have a positive integer, how many ways can this number be written as a sum of its components? By components, I mean all numbers less than that number.
For example, 5 has 6 ways to be written;
5x1, 3x1+2, 2x2+1, 2x1+3,1+4 and 2+3. In digits form; [11111, 1112, 221,113, 14, 23]
So there are 6 ways to write 5.
For number 6; [111111, 11112,1113,114,15, 2+4, 3+3, 1+2+3, 2+2+2 and 1+2+2+1]. which is 10.
In general how many ways to write a number as a sum of all possible combination of numbers less than that number?
 
Mathematics news on Phys.org
LCKurtz said:
Does partition theory include sums of products?

I don't know if it covers sums of products. I was thinking only of the number of ways that a given number can be represented via addition by lower numbers.
 

Similar threads

Undergrad Find an explicit formula for this n-sum problem
  • · Replies 7 ·
Replies
7
Views
3K
High School How to pick some numbers out of 13 integers, by a 4 digits code
  • · Replies 4 ·
Replies
4
Views
2K
MHB Number of Possible Sums with 1-15 Cards
  • · Replies 3 ·
Replies
3
Views
4K
MHB Recreational Number Theory, Unsolved Problem
  • · Replies 1 ·
Replies
1
Views
2K
High School Combinatorics and Magic squares
  • · Replies 2 ·
Replies
2
Views
2K
Undergrad Finding the chromatic number of a graph with biconnected components
  • · Replies 1 ·
Replies
1
Views
2K
MHB What are the factors of -48 that result in a positive sum?
  • · Replies 2 ·
Replies
2
Views
2K
High School Natural Numbers contain all the Primes
  • · Replies 24 ·
Replies
24
Views
3K
MHB How Do You Solve a Geometric Sum with Alternating Signs?
  • · Replies 2 ·
Replies
2
Views
2K
Graduate Rich "isotropic tensor" concept
  • · Replies 1 ·
Replies
1
Views
2K