Results 1 - 10 of 941 for  Wikipedia / Logarithm / Wikipedia    (3565152 articles)

Logarithm print that page


The logarithm of a number is the exponent by which a fixed number, the base , has to be raised to produce that number. For example, the logarithm of 1000 to base 10 is 3, because 1000 is 10 to the power 3: 1000 = 10 3 = 10 × 10 × 10. More generally, if x = b y , then y is

Natural logarithm print that page

The natural logarithm is the logarithm to the base e , where e is an irrational and transcendental constant approximately equal to 2.718 281 828 . The natural logarithm is generally written as ln( x ), log e ( x ) or sometimes, if the base of e is implicit, as simply log( x ). [ 1

wikipedia.org | 2011/9/25 9:05:33

Common logarithm print that page

The common logarithm is the logarithm with base 10. It is also known as the decadic logarithm , named after its base. It is indicated by log 10 ( x ), or sometimes Log( x ) with a capital L (however, this notation is ambiguous since it can also mean the complex natural logarithmic multi

wikipedia.org | 2011/5/5 22:05:10

Indefinite logarithm print that page

The indefinite logarithm of a positive number n (variously denoted [log  n ], Log( n ) or even sometimes just log  n ) is the logarithm without regard to any particular base: it is a function (of the base), not a number . This is as opposed to the ordinary, or definite logarithm ,

wikipedia.org | 2011/3/23 6:37:48

Napierian logarithm print that page

The term Napierian logarithm , or Naperian logarithm , is often used to mean the natural logarithm . However, as first defined by John Napier , it is a function given by (in terms of the modern logarithm ): A plot of the Napierian logarithm for inputs between 0 and 10 8 . (Since

wikipedia.org | 2010/9/26 14:33:41

Iterated logarithm print that page

In computer science , the iterated logarithm of n , written log *   n (usually read " log star "), is the number of times the logarithm function must be iteratively applied before the result is less than or equal to 1. The simplest formal definition is the result of this recursive function

wikipedia.org | 2011/4/10 10:20:29

Discrete logarithm print that page

logarithms are group-theoretic analogues of ordinary logarithms . In particular, an ordinary logarithm log a ( b ) is a solution of the equation a x  =  b over the real or complex numbers . Similarly, if g and h are elements of a finite cyclic group G then a solution x of the equation

wikipedia.org | 2011/7/23 10:40:15

Binary logarithm print that page

In mathematics , the binary logarithm (log 2   n ) is the logarithm to the base 2 . It is the inverse function of n  ↦ 2 n . The binary logarithm of n is the power to which the number 2 must be raised to obtain the value  n . This makes the binary logarithm useful for anything

wikipedia.org | 2011/5/24 9:11:36

Complex logarithm print that page


In complex analysis , a complex logarithm function is an " inverse " of the complex exponential function , just as the natural logarithm ln  x is the inverse of the real exponential function e x . So a logarithm of z is a complex number w such that e w = z . [ 1 ] The notation

Super-logarithm print that page


In mathematics , the super logarithm is one of the two inverse functions of tetration . Just as exponentiation has two inverse functions, roots and logarithms , tetration has two inverse functions, super-roots and super-logarithms. There are several ways of interpreting super-logarithms