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

Method of reduction of order, Consider the equation x 2 y′′+ xy′- y = 4x...

Consider the equation x 2 y′′+ xy′- y = 4x ln x (a) Verify that x is a solution to the homogeneous equation. (b) Use the method of reduction of order to derive the second

Prove gcd value, Let a, b, c 2 Z + . (a) Prove that if a|b, then ac|bc f...

Let a, b, c 2 Z + . (a) Prove that if a|b, then ac|bc for all c. (b) If a|bc, can you conclude that either a|b or a|c? Justify your answer with a proof or a counter example.

Prove that a tree with n vertices has n - 1 edges, Prove that A tree with n...

Prove that A tree with n vertices has (n - 1) edges.    Ans: From the definition of a tree a root comprise indegree zero and all other nodes comprise indegree one. There should

Factoring polynomials with higher degree, Factoring Polynomials with Degree...

Factoring Polynomials with Degree Greater than 2 There is no one method for doing these generally.  However, there are some that we can do so let's take a look at a some exa

., Two boys A and B are at two diametrically opposite points on a circle. A...

Two boys A and B are at two diametrically opposite points on a circle. At one instant the two start running on the circle; A anticlockwise with constant speed v and B clockwise wit

Why is the steepness of a curve partially calculate, Can you explain why is...

Can you explain why is the steepness of a curve partially calculated by the units of measurement?

Three person problem of points, Three-person Problem of Points: Pascal, Fer...

Three-person Problem of Points: Pascal, Fermat and their old friend the Chevalier de Mere each put $10.00 into a pot, and agree to play a game that has rounds. Each player has the

Properties of dot product - vector, Properties of Dot Product u → • (v...

Properties of Dot Product u → • (v → + w → ) = u → • v → + u → • w →          (cv → ) • w → = v → •(cw → ) = c (v → •w → ) v → • w → = w → • v →

How do you traverse a binary tree, How do you traverse a Binary Tree?  Desc...

How do you traverse a Binary Tree?  Describe Preorder, Inorder and Postorder traversals with example.     Ans: Traversal of tree means tree searching for a aim. The aim may be

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