MHB What is the solution for x in the equation 1.4x + 9 = -2?

  • Thread starter Thread starter karush
  • Start date Start date
karush
Gold Member
MHB
Messages
3,240
Reaction score
5
View attachment 8750

Ok I'm doing 11 and 12

I kept trying row reduction but no

W|A

https://www.physicsforums.com/attachments/8751
 
Physics news on Phys.org
Row reduction:
$\begin{bmatrix}1 & 3 & -4 \\ 1 & 5 & 2 \\ -3 & -7 & 6 \end{bmatrix}\begin{bmatrix}-2 \\ 4 \\ 12 \end{bmatrix}$

Subtract the first row from the second row and add 3 times the first row to the third row:
$\begin{bmatrix}1 & 3 & -4 \\ 0 & 2 & 6 \\ 0 & 2 & -6 \end{bmatrix}\begin{bmatrix}-2 \\ 6 \\ 6 \end{bmatrix}$

Subtract the second row from the third row:
$\begin{bmatrix}1 & 3 & -4 \\ 0 & 2 & 6 \\ 0 & 0 & -12 \end{bmatrix}\begin{bmatrix}-2 \\ 6 \\ 0 \end{bmatrix}$

This is now an "upper triangular" matrix which can be solved by "back substitution". The third row is equivalent to the equation -12z= 0 so z= 0. The second row is equivalent to the equation 2y+ 6z= 6 and since z= 0, 2y= 6, y= 3. The first row is equivalent to x+ 3y- 4z= 2 and since y= 3 and z= 0, x+ 9= 2 so x= -7.
 
$\textsf{I think $x=-11$,}$
 
x + 9 = -2 so x = -11.
 
##\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

Back
Top