edited by
20,867 views
66 66 votes

If the following system has non-trivial solution, 

  • $px + qy + rz = 0$
  • $qx + ry + pz = 0$
  • $rx + py + qz = 0$,

then which one of the following options is TRUE?

  1. $p - q + r = 0 \text{ or } p = q = -r$
  2. $p + q - r = 0 \text{ or } p = -q = r$
  3. $p + q + r = 0 \text{ or } p = q = r$
  4. $p - q + r = 0 \text{ or } p = -q = -r$

7 Answers

Best answer
64 64 votes

for non-trivial solution $$\left | A \right | = 0$$

where $\left | A \right | = \begin{bmatrix} p & q& r\\ q& r& p\\ r& p & q \end{bmatrix} = p*(rq-p^{2})-q*(q^{2}-pr)+r*(qp-r^{2})$

$=prq - p^{3} - q^{3} + prq + prq - r^{3}$

$= 3prq - p^{3} - q^{3} - r^{3}$

$=-{\left(p+q+r\right)}^{3} + 3(p+q+r)(pq+qr+pr)$

now if you check the options the only options where each individual condition can make $\left | A \right | = 0$ zero is $C.$

edited by
63 63 votes
Answer = C

If we add all the equations we get

(p+q+r)x + (p+q+r)y + (p+q+r)z = 0

which implies p+q+r=0

Only option C has p+q+r=0
53 53 votes

Let $A=\begin{bmatrix}p & q & r\\q & r & p\\r & p & q \end{bmatrix}$.

Since the system has non-trivial solution, hence

$\begin{align} |A|&=0\\ \Rightarrow \left|\begin{matrix}p & q & r\\q & r & p\\r & p & q \end{matrix}\right| &=0\\ \Rightarrow \left|\begin{matrix}p+q+r & q & r\\p+q+r & r & p\\p+q+r & p & q \end{matrix}\right| &=0;~[C_1 \leftarrow  C_1+C_2+C_3]\\ \Rightarrow (p+q+r)\left|\begin{matrix}1 & q & r\\1 & r & p\\1 & p & q \end{matrix}\right| &=0\\ \Rightarrow (p+q+r)\left\{ (qr-p^2) -(q^2-pr)+(pq-r^2)  \right\} &=0; ~[\scriptsize\text{Expanding the determinant using the 1st column}]\\ \Rightarrow (p+q+r)(p^2+q^2+r^2-pq-qr-rp) &=0 \end{align}$

 

$\therefore p+q+r=0\mathrm{~Or~}(p^2+q^2+r^2-pq-qr-rp)=0~...............\tag{i}$

 

Now

$\begin{align} p^2+q^2+r^2-pq-qr-rp&=0\\ \Rightarrow 2p^2+2q^2+2r^2-2pq-2qr-2rp &=0;~[\scriptsize\text{Multiplying both sides by }2]\\ \Rightarrow (p^2-2pq+q^2)+(q^2-2qr+r^2)+(r^2-2rp+p^2) &=0;~[\scriptsize\text{Rearranging the expression}]\\ \Rightarrow (p-q)^2+(q-r)^2+(r-p)^2 &=0\\ \therefore p-q=0 \mathrm{~And~}q-r=0 \mathrm{~And~}r-p&=0;~[\scriptsize\text{Since the sum of some squares is }0 \text{, hence they must be separately }0.] \\ \Rightarrow p=q \mathrm{~And~}q=r \mathrm{~And~}r=p\\ \Rightarrow p=q=r \end{align}$

 

Therefore, from no$\mathrm{(i)}$, we can conclude that

$$p+q+r=0 \mathrm{~Or~} p=q=r$$.

 

So the correct answer is C.

edited by
26 26 votes
$\begin{bmatrix} p & q &r \\ q & r & p\\ r & p & q \end{bmatrix}$$\begin{bmatrix} x\\ y\\ z \end{bmatrix} = $ $\begin{bmatrix} 0\\ 0\\ 0 \end{bmatrix}$

$R_1 \rightarrow R_1 + R_2 + R_3$

$\begin{bmatrix} p+q+r & p+q+r &p+q+r \\ q & r & p\\ r & p & q \end{bmatrix}$

option C is $p + q + r = 0 \text{ or } p = q = r$

$\begin{bmatrix} 0 & 0 & 0 \\ q & r & p\\ r & p & q \end{bmatrix}$$\begin{bmatrix} x\\ y\\ z \end{bmatrix} = $ $\begin{bmatrix} 0\\ 0\\ 0 \end{bmatrix}$

For non-trivial solution,

if $AX = 0$ then Rank(A) $\leq$ number of unknowns

2 $\leq$ 3

Hence, C is the answer
edited by
0 0 votes

 

 

 

p=q=r doesn't match

Answer:
Position:
Show:

Related questions

60 60 votes
13 answers 13 answers
30.2k
30.2k views
go_editor asked Feb 14, 2015
30,202 views
In the given matrix $\begin{bmatrix} 1 & -1 & 2 \\ 0 & 1 & 0 \\ 1 & 2 & 1 \end{bmatrix}$ , one of the eigenvalues is $1.$ The eigenvectors corresponding to the eigenvalue...
7 7 votes
4 answers 4 answers
8.3k
8.3k views
go_editor asked Feb 16, 2015
8,308 views
Consider the following software items: Program-$X$, Control Flow Diagram of Program-$Y$ and Control Flow Diagram of Program-$Z$ as shown belowThe values of McCabe's Cyclo...
67 67 votes
5 answers 5 answers
20.4k
20.4k views
go_editor asked Feb 16, 2015
20,374 views
Consider the following C program:#include<stdio.h int f1(void); int f2(void); int f3(void); int x=10; int main() { int x=1; x += f1() + f2 () + f3() + f2(); printf("%d", ...
48 48 votes
4 answers 4 answers
13.5k
13.5k views
go_editor asked Feb 16, 2015
13,459 views
Language $L_1$ is polynomial time reducible to language $L_2$. Language $L_3$ is polynomial time reducible to language $L_2$, which in turn polynomial time reducible to l...