Properties of exponential form, Mathematics

Assignment Help:

Properties

1.   The domain of the logarithm function is (0, ∞ ) .  In other terms, we can just plug positive numbers into a logarithm! We can't plug in zero or a negative number.

2.    logb b = 1

3.    logb 1 = 0

4.    logb bx= x

5.    blogb= x

The final two properties will be especially useful into the next section.  Notice that these last two properties tell us that,

f( x ) = b x              and g( x ) = logb x

are inverses of each of other.

Following are some more properties which are useful in the manipulation of logarithms.

More Properties

6.   logbxy= logb  x + logb  y

7.   logb (x/y)=       logb  x - logb  y

8.   logb( xr) = r logb  x

Note as well that there is no equivalent property to the first two for sums & differences. In other terms,

logb( x + y ) ≠ logb  x + logb  y

logb(x - y ) ≠ logb  x - logb  y


Related Discussions:- Properties of exponential form

Design a game strategy involves process of learning maths, Doing these sums...

Doing these sums initially in this way helps children see why they carry over numbers to the next column. You may like to devise some related activities now. , EI) Give activ

Determine the relation is partially ordered, Determine if the relation repr...

Determine if the relation represented by the following Boolean matrix is partially ordered. Ans: Let the following relation R is defined on set A = {x, y, z}. To test if t

How many balls must she select of the same colour, QUESTION (a) A bowl ...

QUESTION (a) A bowl contains ten red balls and ten blue balls. A woman selects balls at random without looking at them. i) How many balls must she select to be sure of havin

Maclaurin series - sequences and series, Maclaurin Series Before w...

Maclaurin Series Before working any illustrations of Taylor Series the first requirement is to address the assumption that a Taylor Series will in fact exist for a specifi

Prove that prims algorithm produces a minimum spanning tree, Prove that Pri...

Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph. Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm

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