24,261 views
59 59 votes

Consider the following system of equations:  

  • $3x + 2y = 1 $
  • $4x + 7z = 1 $
  • $x + y + z = 3$
  • $x - 2y + 7z = 0$

The number of solutions for this system is ______________

12 Answers

Best answer
71 71 votes
Since, equation $(2)$ - equation $(1)$ produces equation $(4)$, we have $3$ independent equations in $3$ variables, hence unique solution.

So, answer is $1.$
• edited by
78 78 votes

sorry for my handwriting!

21 21 votes
Add first two equations and you will get $7x+2y+7z=2$

remaining equations are $x+y+z=3$ and $x-2y+7z=0$

My augmented matrix

$\left[\begin{array}{ccc|c} 1&1&1&3 \\ 7&2&7&2 \\ 1&-2&7&0 \\ \end{array} \right ]$

do $R_2-7R_1 \rightarrow R_2$ and $R_3-R_1 \rightarrow R_3$

$\left[\begin{array}{ccc|c} 1&1&1&3 \\ 0&-5&0&-19 \\ 0&-3&6&-3 \\ \end{array} \right ]$

do $5R_3 - 3R_2 \rightarrow R_3$

$\left[\begin{array}{ccc|c} 1&1&1&3 \\ 0&-5&0&-19 \\ 0&0&30&42 \\ \end{array} \right ]$

your Augmented matrix has same rank as the coefficient matrix=3=number of unknowns, so only 1 solution possible.
2 2 votes
It is having UNIQUE Solution .

 

1 1 vote
Can someone plz find the rank of thie matrix using row transformations.I m not able to do so.Plz help
0 0 votes
rank(Augmented Matrix) = rank(Matrix) = no of unknowns. Hence it has a unique solution
Answer:
Position:
Show:

Related questions

79 79 votes
11 answers 11 answers
33.9k
33.9k views
go_editor asked Sep 28, 2014
33,876 views
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...
110 110 votes
10 answers 10 answers
26.9k
26.9k views
go_editor asked Sep 26, 2014
26,937 views
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________
71 71 votes
9 answers 9 answers
28.0k
28.0k views
go_editor asked Sep 28, 2014
28,030 views
Consider two processors $P_1$ and $P_2$ executing the same instruction set. Assume that under identical conditions, for the same input, a program running on $P_2$ takes $...
146 146 votes
17 answers 17 answers
40.8k
40.8k views
go_editor asked Sep 28, 2014
40,797 views
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $...