You are not logged in.
Pages: 1
how do you go about solving e^x=5?
I was getting confused on a few steps. The * sign is confusing, you think of multiplication. It's subtle, you have to think forwards, then backwards.
But now I understand, well done.
That looks right, but some of the steps are confusing.
You need to make clear your question by the use of brackets first, etc.
The first one you use the quotient rule.
y= (x-2) / (x-1)^2
so y(x) = u(x)/v(x)
then
dy/dx = (v(du/dx) - u(dv/dx))/ v^2
or y' = (vu' - uv')/v^2
u = (x-2), v = (x-1)(x-1) = (x^2-2x+1) (we open up brackets to get to simple orders)
so, du/dx = 1, dv/dx = 2x-2
Therefore: dy/dx = ((x^2-2x+1)*1 - (x-2)*(2x-2))/ (x^2-2x+1)^2
= (x^2-2x+1)-2x^3+2x+4/(x^2-2x+1)^2
= (-2x^3 +x^2 + 5)/(x^2 - 2x +1)^2
= (-2x^3 +x^2 +5)/x^4 - 4x^3 +2x^2 - 4x +1
I could be very wrong though.
Correct. Can you not solve the first simultaneously too?
a +bd - (ab+ad) = ab + d - (ad + bd)
Let a = 1, b=2, d=3
7-5 = 5-9
2 = -4
So it's not associative?
Hmm, but the question was "show that (said operation) is associative" ???
Back again, same question, need to prove it is associative. My answer:
Q. a*b = a+b-ab
A. If associative: (a*b)*c = a*(b*c)
a*(b*d) = a +(b*d) - a(b*d)
So: ab + ad = a +bd - (ab+ad)
(a*d)*b = (a*b) + d - ((a*b) *d)
So: ad + db = ab + d - (ad + bd)
hmmm?
Much appreciated Ricky, I know I've alot to learn, i'm just trying my best.
Ah great! thanks
But how would I prove it?
But I'm dealing with letters, not numbers, you cannot operate on letters. It says defined on R. This is abstract.
How would you show that a binary operation is closed, when dealing with an algebraic example like the following?
a*b = a+b - ab
hmmm?
Pages: 1