Power rule, Mathematics

Assignment Help:

Power rule: d(xn)/dx = nxn-1

There are really three proofs which we can provide here and we are going to suffer all three here therefore you can notice all of them.

The proof of this theorem will work for any real number n. Though, this does suppose that you've read most of the previous section and so must only be read after you have gone during the whole section.

Proof

In this proof we no longer require to confine n to be a positive integer. This can here be any real number. Though, this proof also supposes which you have read all the way throughout previous section. In particular this requires both Implicit Differentiation and Logarithmic Differentiation. If you have not read, and know, these sections so it proof will not make any sense to your understanding.

Therefore, to find set up for logarithmic differentiation let's first name

 y = xn

 after that take the log of both sides and simplify the right side by using logarithm properties and after that differentiate by using implicit differentiation.

 ln y = ln xn

ln y = n ln x

y′/y = n (1/x)

At last, all we require to do is solving for y′ and after that substitute into for y.

y' = y(n/x) = xn(n/x) = nxn-1

Before going onto the subsequent proof, let's consider that in all three proofs we did need the exponent n, be a number which is integer, any real number in this proof.

At last, in the third proof we would have found various derivatives if n had not been a constant.

It is significant as people will frequently misuse the power rule and utilize this even while the exponent is not a number or/and the base is not a variable.


Related Discussions:- Power rule

Tied rankings, Tied Rankings A slight adjustment to the formula is mad...

Tied Rankings A slight adjustment to the formula is made if several students tie and have the similar ranking the adjustment is: (t 3 - t)/12 Whereas t = number of tied

Algebra, what is the answers of exercise 3.1

what is the answers of exercise 3.1

Prove asymptotic bounds for recursion relations, 1. (‡) Prove asymptotic b...

1. (‡) Prove asymptotic bounds for the following recursion relations. Tighter bounds will receive more marks. You may use the Master Theorem if it applies. 1. C(n) = 3C(n/2) + n

Partial derivatives, So far we have considered differentiation of functions...

So far we have considered differentiation of functions of one independent variable. In many situations, we come across functions with more than one independent variable

Circles, alternate segment theorum

alternate segment theorum

Find the shortest paths in the digraph, 1. a) Find the shortest paths from ...

1. a) Find the shortest paths from r to all other nodes in the digraph G=(V,E) shown below using the Bellman-Ford algorithm (as taught in class).  Please show your work, and draw t

Unitary Method Sample Questions, Where can I find sample questions of Unita...

Where can I find sample questions of Unitary Method for kids to practice? I need  Unitary Method  study material if availbale here on website, i found there is very useful material

Money, What is the formulate of finding commission

What is the formulate of finding commission

Tutor, How to be an expert at expertsmind

How to be an expert at expertsmind

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd