Proof by Induction of the Power Rule of Differentiation

tinylights
Messages
18
Reaction score
0

Homework Statement


Okay, the concept here is to use induction to prove that for n, (f1 x f2 x ... x fn-1 x fn)' = (f'1 x f2 x ... x fn) + (f1 x f'2 x ... x fn) + ... + (f1 x f2 x ... x f'n).

2. Homework Equations / 3. The Attempt at a Solution

I solved the initial step, which was quite easy. I started to set up the inductive step, by stating that:

(f1 x f2 ... x fn x fn+1)' = (f'1 x f2 x ... x fn+1) + (f1 x f'2 x ... x fn+1) + ... + (f1 x f2 x ... x f'n+1).

And I do understand how induction works - I know I am supposed to plug in what I have for the "n" equation into part of my "n+1" equation and find equality. I just don't know HOW I'm supposed to do that for some reason. I think it's the derivatives throwing me off because in the last few problems that I did, it was fine. Please help me simplify?
 
Physics news on Phys.org
tinylights said:

Homework Statement


Okay, the concept here is to use induction to prove that for n, (f1 x f2 x ... x fn-1 x fn)' = (f'1 x f2 x ... x fn) + (f1 x f'2 x ... x fn) + ... + (f1 x f2 x ... x f'n).

2. Homework Equations / 3. The Attempt at a Solution

I solved the initial step, which was quite easy. I started to set up the inductive step, by stating that:

(f1 x f2 ... x fn x fn+1)' = (f'1 x f2 x ... x fn+1) + (f1 x f'2 x ... x fn+1) + ... + (f1 x f2 x ... x f'n+1).

And I do understand how induction works - I know I am supposed to plug in what I have for the "n" equation into part of my "n+1" equation and find equality. I just don't know HOW I'm supposed to do that for some reason. I think it's the derivatives throwing me off because in the last few problems that I did, it was fine. Please help me simplify?

(f1 x f2 ... x fn x fn+1)=(f1 x f2 ... x fn) x fn+1. Use the usual two factor product rule on that.
 
Okay, that makes it simpler. I didn't know if I was "allowed" to assume that, or if I had to go from the ground up. I'll double-check with my professor but for now I'll work it out that way. Thanks!
 
tinylights said:
Okay, that makes it simpler. I didn't know if I was "allowed" to assume that, or if I had to go from the ground up. I'll double-check with my professor but for now I'll work it out that way. Thanks!

I didn't "assume" anything. (fg)'=f'g+fg' is the base case for your induction. It's the usual product rule. Sure, you can assume that. And (f1 x f2 ... x fn x fn+1)=(f1 x f2 ... x fn) x fn+1 is just using the associative rule for multiplication. I think you are pretty safe in using that!
 
You titled this "power rule" but talk about the "product rule". Which are you trying to prove?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top