MHB Solving a system of linear equations with one unknown value

sparrow1
Messages
1
Reaction score
0
Hi guys, I'd be grateful for any help with this type of question. It's been driving me crazy. I have an online assignment for my linear algebra course and the question is always like this:

"Determine the values of a for which the following system of linear equations has no solutions, a unique solution, or infinitely many solutions. You can select 'always', 'never', 'a = ', or 'a ≠', then specify a value or comma-separated list of values.

ax1+2x2+4x3 = 4
−2x1−x2−5x3 = −1
−2x1−5x2−x3 = −12"

I know the answer to this one as i got it wrong and the website told me what it was, but not how to get it. What I've been doing is putting it into a matrix (obviously) and then trying to get it into reduced row echelon form, and then trying to get the bottom row into either "0 0 0 I #" form (for infinite solutions), "0 0 0 I 0" (for no solution) and "0 0 1 I #" (for unique solution) where I just represents a line. But that isn't working so I'm clearly doing something wrong.

I can't use a calculator for this class or anything so please only solutions that can be done by hand :) Thank you very much.
 
Physics news on Phys.org
sparrow said:
"Determine the values of a for which the following system of linear equations has no solutions, a unique solution, or infinitely many solutions. You can select 'always', 'never', 'a = ', or 'a ≠', then specify a value or comma-separated list of values.

ax1+2x2+4x3 = 4
−2x1−x2−5x3 = −1
−2x1−5x2−x3 = −12"

I know the answer to this one as i got it wrong and the website told me what it was, but not how to get it.
What immediately strikes you about these equations is (1) that coefficient $a$ comes in a very tiresome place for getting the system in echelon form, and (2) the other two equations have minus signs everywhere.

You can make life easier for yourself by (1) swapping the first and third equations, so that the $a$ goes down to the bottom row of the matrix, (2) changing the signs on both sides of the other two equations. You will then have the system $$2x_1 + 5x_2 + x_3 = 12$$ $$2x_1 + x_2 + 5x_3 = 1$$ $$ax_1 + 2x_2 + 4x_3 = 4,$$ with matrix $$\begin{bmatrix} 2&5&1&12 \\2&1&5&1 \\ a&2&4&4\end{bmatrix}.$$

Now reduce it to echelon form in the usual way, starting by subtracting row 1 from row 2 and subtracting $a/2$ times row 1 from row 3.

sparrow said:
What I've been doing is putting it into a matrix (obviously) and then trying to get it into reduced row echelon form, and then trying to get the bottom row into either "0 0 0 I #" form (for infinite solutions), "0 0 0 I 0" (for no solution) and "0 0 1 I #" (for unique solution) where I just represents a line. But that isn't working so I'm clearly doing something wrong.
You have the first two of those the wrong way round: $0\ 0\ 0\ |\ \#$ means no solutions (if $\#$ is a nonzero number), and $0\ 0\ 0\ |\ 0$ means infinitely many solutions.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
2
Views
3K
Replies
3
Views
1K
Replies
2
Views
3K
Replies
1
Views
1K
Replies
4
Views
3K
Replies
15
Views
2K
Replies
6
Views
2K
Replies
6
Views
2K
Back
Top