Step 1. General Term of the Expansion:
The general term in the binomial expansion of \( \left( x^{2/3} + \frac{1}{2}x^{-2/5} \right)^9 \) is given by:
\[ T_{r+1} = \binom{9}{r} \left( x^{2/3} \right)^{9-r} \left( \frac{x^{-2/5}}{2} \right)^r \]
Simplify the expression:
\[ T_{r+1} = \binom{9}{r} \left( \frac{1}{2} \right)^r x^{\left( \frac{6 - 2r}{3} - \frac{2r}{5} \right)} \]
Step 2. For \( x^{2/3} \):
Set the power of \( x \) equal to \( 2/3 \):
\[ \frac{6 - 2r}{3} - \frac{2r}{5} = \frac{2}{3} \]
Solving this equation gives \( r = 5 \).
Substituting \( r = 5 \) into the coefficient formula:
\[ \text{Coefficient of } x^{2/3} = \binom{9}{5} \left( \frac{1}{2} \right)^5 \]
Step 3. For \( x^{-2/5} \):
Set the power of \( x \) equal to \( -2/5 \):
\[ \frac{6 - 2r}{3} - \frac{2r}{5} = -\frac{2}{5} \]
Solving this equation gives \( r = 6 \).
Substituting \( r = 6 \) into the coefficient formula:
\[ \text{Coefficient of } x^{-2/5} = \binom{9}{6} \left( \frac{1}{2} \right)^6 \]
Step 4. Sum of the Coefficients:
Add the two coefficients:
\[ \text{Sum} = \binom{9}{5} \left( \frac{1}{2} \right)^5 + \binom{9}{6} \left( \frac{1}{2} \right)^6 \]
Simplify:\[ \text{Sum} = \frac{21}{4}\]
Let \( A = \{-3, -2, -1, 0, 1, 2, 3\} \). A relation \( R \) is defined such that \( xRy \) if \( y = \max(x, 1) \). The number of elements required to make it reflexive is \( l \), the number of elements required to make it symmetric is \( m \), and the number of elements in the relation \( R \) is \( n \). Then the value of \( l + m + n \) is equal to:
For hydrogen-like species, which of the following graphs provides the most appropriate representation of \( E \) vs \( Z \) plot for a constant \( n \)?
[E : Energy of the stationary state, Z : atomic number, n = principal quantum number]
The number of 6-letter words, with or without meaning, that can be formed using the letters of the word MATHS such that any letter that appears in the word must appear at least twice, is $ 4 \_\_\_\_\_$.
The largest $ n \in \mathbb{N} $ such that $ 3^n $ divides 50! is: