Race to 9001

<p>I suppose that’s true</p>

<p>^^ bbcode must be learned!</p>

<p>[I&lt;/a&gt; just feel like posting this](<a href=“http://www.math.ucla.edu/~jinsunks/151.1.11f/hw/homework8.pdf]I”>http://www.math.ucla.edu/~jinsunks/151.1.11f/hw/homework8.pdf)</p>

<p>my pet bird is going to go all his life knowing the closest thing he’s gotten to a potential mate was his reflection in the mirror…</p>

<p>is it sad this makes me sad?</p>

<p>Does your pet bird actually know this?</p>

<p>maybe he does, maybe he doesn’t. do we really know if birds can have that kind of thought process?</p>

<p>or maybe he innately knows he needs to have a mate, but can’t get past the glass of his little toy mirror, therefore he will forever be biologically unsuccessful.</p>

<p>Orgo is slowly raping me.</p>

<p>It isn’t very pleasant. Not sure why I took this class…</p>

<p>slow rape is never pleasant</p>

<p>am I the only person occasionally getting large black rectangles at the bottom of my CC page?</p>

<p>I don’t see them.</p>

<p>Hmm, it seems to have gone away…</p>

<p>so mysterious</p>

<p>yet another CC mystery</p>

<p>Like Ben Baker?</p>

<p>Ben Baker the [url=&lt;a href=“http://www.benbakerphoto.com/index.php]photographer?[/url”&gt;http://www.benbakerphoto.com/index.php]photographer?[/url</a>]</p>

<p>iirc, ben baker was mentioned in a thread than an account called BenBaker suddenly showed up. And it wasn’t a new account.</p>

<p>Or something like that.</p>

<p>Does anyone know anything about determining the degree of a polynomial remainder?</p>

<p>Specifically, there seems to be a theorem that given a polynomial P(x) with degree in [n,2n) and another polynomial p(x) with degree n, then there exist polynomials Q(x) and R(x) of degree less than n such that P(x)=p(x)Q(x)+R(x). I would like to see a proof of this theorem.</p>

<p>If we are all worse at math than Yankster, and he asks you for help with math homework, and later you have a problem with math, none of us are going to be able to help</p>

<p>Except maybe InquilineKea</p>

<p>or maybe TYiL again</p>

<p>What do you want, the existence or degree of R(x)?</p>

<p>Well, it’s obvious that for any polynomial Q(x), p(x)Q(x) is a polynomial, so there would exist a polynomial R(x) such that P(x)=p(x)Q(x) + R(x). Really, the R(x) needed is just a function of the Q(x) chosen.</p>

<p>So I guess the issue is the existence of a Q(x) for which the resulting R(x) has degree less than n. That such a Q(x) would also need to have degree less than n is fairly trivial.</p>

<p>p(x)Q(x) has to cancel out all the powers in P(x) greater or equal to n when you subtract, so that P(x) - p(x)*Q(x) = R(x), a polynomial of less than degree n. </p>

<p>I think it’s possible to devise a Q(x) that will do that, generally. You can solve for the coefficients of the terms in Q(x) in terms of the coefficients of the terms in P(x), p(x). One way is to start by canceling the largest power in P(x), and working your way down to the nth power (the expressions for the coefficients of Q(x) get longer and longer as they become dependent on the previous coefficients of Q(x) ). . </p>

<p>one obvious thing about Q(x) is that its degree is equal to the the degree of P(x) - the degree of p(x)</p>