This site is supported by donations to The OEIS Foundation.

Logarithms

From OeisWiki
(Redirected from Logarithm base b)
Jump to navigationJump to search


This article needs more work.

Please help by expanding it!



This article page is a stub, please help by expanding it.


The base b logarithm is the inverse of the base b exponential, i.e.

logbby:=y,b>0,b1.

For example, log72401=4, since 74=2401. If the base is not specified, in mathematics it is assumed to be Euler's number e=2.71828 since it is the base of the natural logarithm, although among scientists and engineers the tacit base might be 10 (decimal logarithm, common logarithm); they then use lnx when the base is e. The notation Leonhard Euler himself used was lx,[1] which thankfully has been changed to something a little clearer. In computer science, base 2 (binary logarithm) is often considered.

Formulae

[edit]

Since x=by implies logx=ylogb, we have

y=logbx=logxlogb,b>0,b1,

where log denotes the natural logarithm.

Maclaurin series expansions

[edit]

Since for geometric series we have

11x=n=0xn,|x|<1,

thus

log(11x)=log(1x)=0xdu1u=0xn=0un=n=0un+1n+1|0x=n=0xn+1n+1=n=1xnn,|x|<1,

is the generating function of the harmonic sequence (unit fractions)

{11,12,13,14,15,16,17,18,19,110,111,112,},

and (replacing x by x)

log(1+x)=n=1(1)n+1xnn,|x|<1,

is the generating function of the alternating harmonic sequence

{11,12,13,14,15,16,17,18,19,110,111,112,},

which sums to log(2), obtained by setting x to 1, the convergence being assured by the alternating series test.

Also (since the fractions with even denominators cancel out)

log1+x1x=12log(1+x1x)=n=1x2n12n1,|x|<1,

is the generating function of the unit factions with odd denominators

{11,13,15,17,19,111,113,115,117,119,121,123,},

and (since the fractions with odd denominators cancel out)

log11x2=12log(1(1+x)(1x))=n=1x2n2n,|x|<1,

is the generating function of the unit factions with even denominators

{12,14,16,18,110,112,114,116,118,120,122,124,}.

See also

[edit]



Hierarchical list of operations pertaining to numbers [2] [3]

[edit]
0th iteration
[edit]
1st iteration
[edit]
  • Addition:  
    S(S( "a times" (S(n))))
    , the sum
    n  +  a
    , where  
    n
    is the augend and  
    a
    is the addend. (When addition is commutative both are simply called terms.)
  • Subtraction:  
    P(P( "s times" (P(n))))
    , the difference
    n  −  s
    , where  
    n
    is the minuend and  
    s
    is the subtrahend.
2nd iteration
[edit]
  • Multiplication:  
    n + (n + ( "k times" (n + (n))))
    , the product
    m  ⋅   k
    , where  
    m
    is the multiplicand and  
    k
    is the multiplier.[4] (When multiplication is commutative both are simply called factors.)
  • Division: the ratio
    n  /  d
    , where  
    n
    is the dividend and  
    d
    is the divisor.
3rd iteration
[edit]
4th iteration
[edit]
5th iteration
[edit]
6th iteration
[edit]
  • Hexation ( 
    d
    as "degree",  
    b
    as "base",  
    n
    as "variable").
    • Hexa-powers:  
      n ^^^ (n ^^^ ( "d times" (n ^^^ (n))))
      , written  
      n ^^^^ d or n ↑↑↑↑ d
      .
    • Hexa-exponentials:  
      b ^^^ (b ^^^ ( "n times" (b ^^^ (b))))
      , written  
      b ^^^^ n or b ↑↑↑↑ n
      .
  • Hexation inverses
7th iteration
[edit]
  • Heptation ( 
    d
    as "degree",  
    b
    as "base",  
    n
    as "variable").
    • Hepta-powers:  
      n ^^^^ (n ^^^^ ( "d times" (n ^^^^ (n))))
      , written  
      n ^^^^^ d or n ↑↑↑↑↑ d
      .
    • Hepta-exponentials:  
      b ^^^^ (b ^^^^ ( "n times" (b ^^^^ (b))))
      , written  
      b ^^^^^ n or b ↑↑↑↑↑ n
      .
  • Heptation inverses
8th iteration
[edit]
  • Octation ( 
    d
    as "degree",  
    b
    as "base",  
    n
    as "variable").
    • Octa-powers:  
      n ^^^^^ (n ^^^^^ ( "d times" (n ^^^^^ (n))))
      , written  
      n ^^^^^^ d or n ↑↑↑↑↑↑ d
      .
    • Octa-exponentials:  
      b ^^^^^ (b ^^^^^ ( "n times" (b ^^^^^ (b))))
      , written  
      b ^^^^^^ n or b ↑↑↑↑↑↑ n
      .
  • Octation inverses

Notes

[edit]
  1. Ed Sandifer, "How Euler did it: Finding logarithms by hand," July 2005.
  2. HyperoperationWikipedia.org.
  3. Grzegorczyk hierarchyWikipedia.org.
  4. There is a lack of consensus on which comes first. Having the multiplier come second makes it consistent with the definitions for exponentiation and higher operations. This is also the convention used with transfinite ordinals:  
    ω  ×  2 := ω  +  ω
    .

Notes

[edit]