Consider the following system of linear equations:
x + 2y + 3z = 0
2x + py = 0
3x + 2y + pz = 0
The value(s) of \( p \) for which the system of equations have infinitely many solutions is/are:
We are given the following system of linear equations: x + 2y + 3z = 0
2x + py = 0
3x + 2y + pz = 0
Represent the system in augmented matrix form:
\[ \begin{bmatrix} 1 & 2 & 3 & | & 0 \\ 2 & p & 0 & | & 0 \\ 3 & 2 & p & | & 0 \end{bmatrix} \]
Perform row operations to simplify the matrix.
Step 1: Subtract \( 2 \times \) Row 1 from Row 2:
\[ \begin{bmatrix} 1 & 2 & 3 & | & 0 \\ 0 & p-4 & -6 & | & 0 \\ 3 & 2 & p & | & 0 \end{bmatrix} \]
Next, subtract \( 3 \times \) Row 1 from Row 3:
\[ \begin{bmatrix} 1 & 2 & 3 & | & 0 \\ 0 & p-4 & -6 & | & 0 \\ 0 & -4 & p-9 & | & 0 \end{bmatrix} \]
Step 2: To find when the system has infinite solutions, we calculate the determinant of the coefficient matrix:
\[ \begin{vmatrix} 1 & 2 & 3 \\ 0 & p-4 & -6 \\ 0 & -4 & p-9 \end{vmatrix} = 1 \cdot \begin{vmatrix} p-4 & -6 \\ -4 & p-9 \end{vmatrix} \]
Expanding the determinant:
\[ = (p-4)(p-9) - (-6)(-4) \]
\[ = p^2 - 13p + 36 - 24 \]
\[ = p^2 - 13p + 12 \]
Set the determinant equal to 0:
\[ p^2 - 13p + 12 = 0 \]
Factoring:
\[ (p - 12)(p - 1) = 0 \]
Thus, \( p = 12 \) or \( p = 1 \).
Step 3: Check the consistency of the system for these values of \( p \). Both \( p = 1 \) and \( p = 12 \) make the system dependent, meaning there are infinitely many solutions.
Therefore, the correct answer is: \( p = 1 \) and \( D \) \( p = 12 \)
Eight students (P, Q, R, S, T, U, V, and W) are playing musical chairs. The figure indicates their order of position at the start of the game. They play the game by moving forward in a circle in the clockwise direction.
After the 1st round, the 4th student behind P leaves the game.
After the 2nd round, the 5th student behind Q leaves the game.
After the 3rd round, the 3rd student behind V leaves the game.
After the 4th round, the 4th student behind U leaves the game.
Who all are left in the game after the 4th round?

The following figures show three curves generated using an iterative algorithm. The total length of the curve generated after 'Iteration n' is:

Two players \( A \) and \( B \) are playing a game. Player \( A \) has two available actions \( a_1 \) and \( a_2 \). Player \( B \) has two available actions \( b_1 \) and \( b_2 \). The payoff matrix arising from their actions is presented below:

Let \( p \) be the probability that player \( A \) plays action \( a_1 \) in the mixed strategy Nash equilibrium of the game.
Then the value of p is (round off to one decimal place).
Here are two analogous groups, Group-I and Group-II, that list words in their decreasing order of intensity. Identify the missing word in Group-II.
Abuse \( \rightarrow \) Insult \( \rightarrow \) Ridicule
__________ \( \rightarrow \) Praise \( \rightarrow \) Appreciate
The 12 musical notes are given as \( C, C^\#, D, D^\#, E, F, F^\#, G, G^\#, A, A^\#, B \). Frequency of each note is \( \sqrt[12]{2} \) times the frequency of the previous note. If the frequency of the note C is 130.8 Hz, then the ratio of frequencies of notes F# and C is: