Multinomial coefficient question.

  • Context: Undergrad 
  • Thread starter Thread starter MathematicalPhysicist
  • Start date Start date
  • Tags Tags
    Coefficient
Click For Summary
SUMMARY

The discussion focuses on determining which term in the multinomial expansion of \((x_1 + x_2 + ... + x_k)^{rk}\) has the greatest coefficient when \(r > 1\). The conclusion is that the maximum coefficient occurs when \(n_1 = n_2 = ... = n_k = r\). This is supported by the reasoning that if any \(n_k\) is less than \(r\), another must exceed \(r\), resulting in a smaller coefficient. The user also mentions the potential use of Lagrange multipliers to prove this, although they seek a combinatorial solution.

PREREQUISITES
  • Understanding of multinomial expansions
  • Familiarity with combinatorial coefficients
  • Basic knowledge of Lagrange multipliers
  • Concept of maximizing functions in calculus
NEXT STEPS
  • Study the properties of multinomial coefficients
  • Learn about Lagrange multipliers in optimization problems
  • Explore combinatorial proofs for optimization in multinomial expansions
  • Investigate applications of multinomial coefficients in probability theory
USEFUL FOR

Mathematicians, students studying combinatorics, and anyone interested in optimization techniques in polynomial expansions.

MathematicalPhysicist
Science Advisor
Gold Member
Messages
4,662
Reaction score
372
let r>1 which term in (x1+...+xk)^rk has the greatest coefficient?
well i have this equation:
[tex](x_1+x_2+...+x_k)^{rk}=\sum_{n_1+n_2+...+n_k=rk}\left(\begin{array}{cc}rk\\\ n_1,n_2,...,n_k\end{array}\right)x^{n_1}...x^{n_k}[/tex]
well if we notice that (n_1+...+n_k)/k=r then the maximum coefficient is achieved when n_1=n_2=...=n_k=r, but the only way i can see how show that this is true is with lagrange multipliers, and i haven't yet used this method in my calclulus classes so i guess there's a combinatorial solution here. anyone care to hint me this method?

thanks in advance.
 
Last edited:
Physics news on Phys.org
well i think i solved it.
if one of n_k's is smaller than r then there must be another one that is bigger than r and so we will have the coeffiecient smaller than the one achieved by n1=...=nk=r.
this is why we get that this must be hthe maximum coefficient.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 27 ·
Replies
27
Views
3K
  • · Replies 5 ·
Replies
5
Views
17K
Replies
4
Views
2K