<p>i got this problem today in algebra 2 and i can't figure it out. usually, i am pretty good at these things, but today i'm totally stumped.</p>
<p>the best way that i could explain it was to put a picture up of it:</p>
<p>
<a href="http://i10.tinypic.com/4vpzh3t.jpg%5B/IMG%5D">http://i10.tinypic.com/4vpzh3t.jpg
</a></p>
<p>if you can't read my handwriting, the equation must isolate s.</p>
<p>if you could help me, that'd be great! thanks!</p>
<p>wow, that's algebra two? looks way harder than the stuff we did. </p>
<p>this thread is probably going to get deleted because of some sort of no homework help rule. ask a friend tommorow before class.</p>
<p>that's what I was thinking ^
but if you look at the answer format he's given it's just saying to get S on the left of the denominator</p>
<p>in any case, the best I could do was:</p>
<pre><code> R2
</code></pre>
<hr>
<p>R1R2CS + R1 + R2</p>
<p>there's no way to isolate the S any further...</p>
<p>Yes. The most reduced form is (R2)/(R1R2CS + R1 + R2).</p>
<p>yay math nerds! </p>
<p>give me more problems as I am at work and bored.</p>
<p>I like the little hair in the picture :D`</p>
<p>aww gross is that what that is? :D</p>
<p>hmm, well i got the same answer as chaostheory and my teacher said it was wrong. i guess i'll keep working on it. thanks though, even if this does get deleted.</p>
<p>oh, its not hair, its just a string. don't worry, i'm not gross or anything :)</p>
<p>29? :)</p>
<p>.................</p>
<p>that one was too easy. I'm still stumped by this algebra problem! that should have been the answer.</p>
<p>What is "CS?" Is "c" a constant/variable multiplied by "S"?</p>
<p>Prove the Poincar</p>
<p>i dont think c is a constant. this problem is supposed to represent parts of a computer chip, i believe.</p>
<p>
[quote]
Prove the Poincar</p>
<p>Pffft. That's one of the easiest proofs out there, man!</p>
<p>What is the rule for the following sequence?</p>
<p>3, 4, 5, 7, 11, 13, 17, 23, 29, 43, 47, 83, 131, 137, 359, 431, 433, 449, 509, 571, 2971, 4723, 5387...</p>
<p>Should keep you busy for a few minutes. ;)</p>
<p>Chaos: I will answer that as soon as you prove that there are unique positive integers a, n such that a^(n+1) - (a+1)^n = 2001.</p>
<p>I was going to say all prime numbers but 4 doesn't work. That's as far into patterns as my brain thinks =].</p>
<p>Hmmm. Give me a few minutes. It's a number theory problem.</p>
<p>Edit: Actually, I'll do it in a couple hours.
Edit: Tomorrow.
Edit: Couple days.</p>
<p>lol </p>
<p>to the OP: a thought occurs. Maybe your teacher just wants you to continue to simplify the expression beyond what you had so that you end up with:</p>
<p>(1/R1C)</p>
<hr>
<p>S + [(R1C + R2C)/(R1R2C^2)]</p>
<p>there...now s is all alone. :D</p>
<p>Either I did something wrong or I just didn't do what your teacher wanted, but simplified, I got </p>
<p>1</p>
<hr>
<p>R1+1</p>
<p>Maybe if you made that equal to the original equation you could isolate S?</p>
<p>Chaos' numbers are Fibonacci primes.</p>
