Answer:
x > 15
Step-by-step explanation:
So here we have to find the value of x
So, Subtract 5 from both sides;
-10x < -5 - 145
Now collect like terms,
-10x < -150
Divide both sides by -10
x > 15
The sign changes because if an equality is divided by a negative number the sign automatically changes.
Answer: 7800
Step-by-step explanation:
As English alphabet has 26 letters.
So , Choices for First character in the code = 26
The choices for digits = 10 (From 0 to 9)
So , choices for second character = 10 (Middle two characters must be numbers)
choices for third character = 10 (Middle two characters must be numbers)
Choices for last character = 3 (the last character must be a 1, 3, or 7)
By Fundamental principle of counting , the total number of four character codes can be generated =
(Choices for First character)x (choices for digits) x(choices for digits) x(Choices for last character)
= (26) (10)(10)(3) =7800
Hence, the total number of character codes can be generated= 7800
Check the Wronskian determinant:
![W(e^{x/2},xe^{x/2})=\begin{vmatrix}e^{x/2}&xe^{x/2}\\\frac12e^{x/2}&\left(1+\frac x2\right)e^{x/2}\end{vmatrix}=\left(1+\frac x2\right)e^x-\frac x2e^x=e^x\neq0](https://tex.z-dn.net/?f=W%28e%5E%7Bx%2F2%7D%2Cxe%5E%7Bx%2F2%7D%29%3D%5Cbegin%7Bvmatrix%7De%5E%7Bx%2F2%7D%26xe%5E%7Bx%2F2%7D%5C%5C%5Cfrac12e%5E%7Bx%2F2%7D%26%5Cleft%281%2B%5Cfrac%20x2%5Cright%29e%5E%7Bx%2F2%7D%5Cend%7Bvmatrix%7D%3D%5Cleft%281%2B%5Cfrac%20x2%5Cright%29e%5Ex-%5Cfrac%20x2e%5Ex%3De%5Ex%5Cneq0)
The determinant is not zero, so the solutions are indeed linearly independent.
no
i have no idea what to do
Answer:
x = 80
Step-by-step explanation:
x + 30 = 110 (opposite sides are congruent/equal)
x = 110 - 30 (subtract the 30 from both sides to get X by itself)
x = 80 (simplify)