Answer Probability Quiz: ((x1 + x2 +... + x33)^4) Monomials & Sum

  • Thread starter Thread starter ParisSpart
  • Start date Start date
  • Tags Tags
    Probability Quiz
AI Thread Summary
The discussion focuses on finding the number of monomials of the form (xi^2)*(xj^2) in the expansion of ((x1 + x2 +... + x33)^4) with i not equal to j. Participants emphasize the importance of combinatorial methods rather than probabilistic approaches to solve the problem. The key is to recognize patterns in smaller expansions, such as (x1 + x2 + x3)^4, which yields 18 such monomials. The solution involves counting the ways to select pairs from the set of variables, leading to a combinatorial formula for the total count. Ultimately, the discussion highlights the need for a systematic approach to extend findings from smaller cases to the larger scenario with 33 variables.
ParisSpart
Messages
129
Reaction score
0
In the expansion of ((x1 + x2 +... + x33) ^ 4) how many monomials are of the form (xi ^ 2)*(xj^2)
with i not equal with j

if we add the coefficients of all these mononymon what is the sum?

E.g. the expansion of (x1 + x2 + x3) ^ 4 the requested number is 18

this is a probability quiz but i can think how to solve it with theory of probabilities any ideas for howmto beggin to solve this?
 
Physics news on Phys.org
There is nothing probabilistic here, but combinatorics is important.
Have a closer look at your example - you should see some pattern about the coefficients. Find that pattern, and extend it to 33.
 
ParisSpart said:
E.g. the expansion of (x1 + x2 + x3) ^ 4 the requested number is 18
I don't think so. I believe 6x12x22 constitutes one monomial.
 
I think it comes down to counting the number of ways of selecting a pair from {1,2,...,33}. For each

pair (xi[/SUBi,xj)) ,there will be one term xi[/SUP]2[/SUP]*xj2 . The general binomial coefficient ci in

ci x1y1x2y2x3y3 x4y4 counts

precisely the number of ways of selecting a total of y_1 x_1's, y_2 x_2's, etc. in the product.

Then ,for

xi2xj2, you're counting the number of ways of selecting exactly 2 x_i's and 2 x_j's from the expansion :

(x1+x2+x3+x4)... ( 4 times )

How many ways can you choose a pair (xi,xj) from

(x1,x2, x3,...,x33)?
 
Last edited:
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Back
Top