Solving Sum of Integers for Given Constraints

  • Context: Undergrad 
  • Thread starter Thread starter TriTertButoxy
  • Start date Start date
  • Tags Tags
    Integers Sum
Click For Summary
SUMMARY

The discussion revolves around solving a mathematical problem involving positive integers \(\ell\) and \(m\) under specific constraints. The equations to satisfy are \(\sum_{n=1}^\ell k_n = m\) and \(\sum_{n=1}^\ell n k_n = \ell\). A key insight shared is that the problem relates to Bell's polynomials and the exponential formula. Participants suggest that for the sum to equal \(\ell\), many \(k_n\) values must be zero, particularly if \(m\) divides \(\ell\>.

PREREQUISITES
  • Understanding of positive integers and their properties
  • Familiarity with summation notation and equations
  • Knowledge of Bell's polynomials
  • Basic concepts of combinatorial mathematics
NEXT STEPS
  • Research Bell's polynomials and their applications in combinatorics
  • Study the exponential generating functions related to integer partitions
  • Explore the concept of integer partitions and their constraints
  • Learn about the implications of divisibility in combinatorial problems
USEFUL FOR

Mathematicians, physics students, and anyone interested in combinatorial mathematics and integer partition problems will benefit from this discussion.

TriTertButoxy
Messages
190
Reaction score
0
Hi, I'm doing a physics calculation, and along the way, I've run up against a curious math problem. I'm sure this is a rather classic problem in mathematics, but I'm just not acquainted with the subject enough to answer it, or even look it up, so hopefully someone can point me in the right direction.

For a given positive integer \ell>0 and another positive integer m\leq\ell, for what values of a list of (zero or positive) integers \{k_1\geq0,\,k_2\geq0,\,\ldots,\,k_\ell\geq0\} satisfies the following simultaneous pair of equations?
\sum_{n=1}^\ell k_n = m
\sum_{n=1}^\ell n k_n = \ell

Even the name given to the problem would point me in the right direction. Thanks!
Also, please do not treat me like a student :-)
 
Physics news on Phys.org
Ok, I think I found the answer; The answer has something to do with Bell's polynomials, and exponential formula. Thanks anyway :-)
 
TriTertButoxy said:
Hi, I'm doing a physics calculation, and along the way, I've run up against a curious math problem. I'm sure this is a rather classic problem in mathematics, but I'm just not acquainted with the subject enough to answer it, or even look it up, so hopefully someone can point me in the right direction.

For a given positive integer \ell>0 and another positive integer m\leq\ell, for what values of a list of (zero or positive) integers \{k_1\geq0,\,k_2\geq0,\,\ldots,\,k_\ell\geq0\} satisfies the following simultaneous pair of equations?
\sum_{n=1}^\ell k_n = m
\sum_{n=1}^\ell n k_n = \ell

Even the name given to the problem would point me in the right direction. Thanks!
Also, please do not treat me like a student :-)
For the sum to add up to no more than \ell there would have to be a lot of k's equal to zero since for larger integers the sum would easily exceed \ell. To find a solution, I would suggest that assume all but one k were zero and that m divides \ell. P.S. this doesn't look like a classic problem.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 3 ·
Replies
3
Views
6K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K