TuringTest
  • TuringTest
Bonus problem: Let\[f(x)=x^p(1+x)^q\]find\[f^{(p+q)}(x)\]
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
TuringTest
  • TuringTest
last time I posted this joemath just saw the answer, and Mr.Math just referred me to a link... I wanna see some thought-process this time
KingGeorge
  • KingGeorge
Looks like lots of chain rule is involved.
TuringTest
  • TuringTest
...also directly from MIT OCW

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

KingGeorge
  • KingGeorge
Let's see, since we're doing \(p+q\) derivations, that means that we'll just have a constant term. since the degree of the polynomial would be \(p+q\).
TuringTest
  • TuringTest
^thinking along the right lines :)
KingGeorge
  • KingGeorge
The minimum would be \[2\cdot p! \cdot q!\] but I'm not sure if that's also the maximum value.
KingGeorge
  • KingGeorge
If I had to take a wild guess, I'd say the answer would be \[p \cdot q \cdot (p! \cdot q!)\]
TuringTest
  • TuringTest
not sure what you mean by minimum... that's close to the answer I got the first time, but it's not quite right
anonymous
  • anonymous
what math is this btw?
TuringTest
  • TuringTest
Basic calculus =) hint? (small one, I promise)
KingGeorge
  • KingGeorge
No hint yet. give me a couple more minutes for my next idea.
KingGeorge
  • KingGeorge
Let's expand everything first and distribute, and see where we go.\[x^p(x+1)^q=x^p\left(\binom{q}{0}x^q + (\text{stuff})\right)=x^{p+q} + \text{stuff}\]That would then give us an answer of \[f^{(p+q)}=(p+q)!\]
TuringTest
  • TuringTest
haha, I love that solution! so different and simpler than the one I know
KingGeorge
  • KingGeorge
I love using the word "stuff" in mathematical proofs.
TuringTest
  • TuringTest
fyi, the technical way to write "stuff" is \(O p(x)\) the big O symbolizing the junk terms my solution is based on the Leibniz formula\[\sum\left(\begin{matrix}n\\k\end{matrix}\right)u^{(n-k)}v^k\]which I'm sure you notice the similarities between that and the binomial theorem
TuringTest
  • TuringTest
*oops Leibniz formula:\[(uv)^{(n)}=\sum_{k=0}^{n}\left(\begin{matrix}n\\k\end{matrix}\right)u^{(n-k)}v^k\]
TuringTest
  • TuringTest
plug in n=p+q and you find that k=q is the only surviving (non-vanishing) term \[\left(\begin{matrix}p+q\\q\end{matrix}\right)u^{(p)}v^{(q)}=(p+q)!\]
KingGeorge
  • KingGeorge
I still like my way better, but that's still really interesting.
TuringTest
  • TuringTest
I agree, your's is simpler, which is more elegent

Looking for something else?

Not the answer you are looking for? Search for more explanations.