How can I solve equations by rearranging them?

  • Thread starter Thread starter hamerish
  • Start date Start date
hamerish
Messages
5
Reaction score
0
For some reason I have always had problems with rearranging equations, I have no idea how I have got so far in life without knowing how to, so iv been teaching myself.

Ita extremely simple as well, and that's why i get so worked up about them

(x-400)/(1000-400)=0.5623

I know x is 737 I just don't know how to get to it.

Any help is appreciated

Rob
 
Physics news on Phys.org
(x-400)/(600)=0.5623
x-400=0.5623(600)
x=0.5623(600)+400
from there it's arithmetic
x=737.38~737
 
okay, I'll give you a quick lesson on the real numbers!
Here are four 'axioms' things that we take as true
1. For any non zero real number, a, there exists another real number \frac{1}{a} such that a * \frac{1}{a} = 1
2. For any real number, b, there exists another real number -b such that b +(-b) = 0
3. Operations in the real numbers commute (this means that a * b = b * a and that a + b = b + a)
4. For any real number c, c*1 = c and c + 0 = c

We'll use these to help us solve this problem

(x-400)/(1000-400)=0.5623

This is the same as saying
(x-400) * \frac{1}{(1000-400)} = 0.5623

We shall first simplify the things in the brakets by doing 1000-400 = 600 to get
(x-400) * \frac{1}{600} = 0.5623

Next we shall invoke axiom 1 to state that there exists a number such that \frac{1}{600} * a = 1 and we can easily see that a must be 600 (to see this use axiom 3 and 1)
We shall then multiply both sides by 600 (we must perform the same operations to both sides to keep the equality)

(x-400) * \frac{1}{600} * 600 = 0.5623 * 600

Using axiom 1

(x-400) * 1 = 0.5623 * 600

Using axiom 4

x-400 = 0.5623 * 600

Using axiom 2 we find that there exists a number, a, such that -400 + a = 0, we can see that a must be 400 again, so adding 400 to both sides

x - 400 + 400 = 0.5623 * 600 + 400

Using axiom 2 to state 400 + (-400) = 0

x + 0 = 0.5623 * 600 + 400

Using axiom 4

x = 0.5623 * 600 + 400

Does this help?
 
##\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...
Back
Top