Search results

Jump to navigation Jump to search

Page title matches

  • ...al-align:-5%;"><math>c</math></font> is the logarithm. In other words, the logarithm <font style="vertical-align:-5%;"><math>c</math></font> is the [[Power law| ...address of a particular location in computer memory is equal to the base-2 logarithm (rounded upwards) of the number of possible locations. Logarithms are also
    19 KB (3,039 words) - 12:51, 7 March 2023
  • 151 bytes (20 words) - 09:11, 1 June 2008
  • #REDIRECT[[Logarithm]]
    22 bytes (2 words) - 10:30, 25 October 2008
  • Text books explaining the real logarithm:
    924 bytes (133 words) - 08:35, 31 October 2008
  • #redirect [[logarithm]]
    23 bytes (2 words) - 17:33, 28 April 2007
  • #REDIRECT [[Logarithm]]
    23 bytes (2 words) - 18:08, 28 April 2007
  • 12 bytes (1 word) - 11:32, 4 November 2007
  • '''Discrete logarithm''' is a problem of finding logarithms in a [[finite field]]. Given a field ...t exponentiation is relatively easy but the inverse operation, finding the logarithm, is hard. The cryptosystems are designed so that the user does only easy op
    5 KB (772 words) - 17:15, 6 August 2013
  • 12 bytes (1 word) - 15:20, 21 January 2008
  • {{r|Discrete logarithm}}
    237 bytes (29 words) - 08:06, 14 January 2009
  • * [http://mathworld.wolfram.com/CommonLogarithm.html Common logarithm] (Wolfram's Mathworld website) *[http://www.math.utah.edu/~pa/math/log.html What on Earth is a logarithm?] ([[University of Utah]] website)
    423 bytes (56 words) - 20:49, 27 October 2008
  • 88 bytes (12 words) - 22:16, 3 January 2009
  • {{r|Logarithm}}
    307 bytes (40 words) - 11:59, 15 June 2009
  • '''[[Fixed point]]s of [[logarithm]]''' to base <math>b</math> are solutions <math>L</math> of equation ...unction that expresses one of these solutions <math>L_1</math> through the logarithm of the base <math>b</math>
    3 KB (424 words) - 14:32, 9 September 2020
  • 58 bytes (5 words) - 16:32, 26 May 2023

Page text matches

  • * [http://mathworld.wolfram.com/CommonLogarithm.html Common logarithm] (Wolfram's Mathworld website) *[http://www.math.utah.edu/~pa/math/log.html What on Earth is a logarithm?] ([[University of Utah]] website)
    423 bytes (56 words) - 20:49, 27 October 2008
  • #redirect [[logarithm]]
    23 bytes (2 words) - 17:30, 28 April 2007
  • #redirect [[logarithm]]
    23 bytes (2 words) - 17:33, 28 April 2007
  • #redirect [[logarithm]]
    23 bytes (2 words) - 17:34, 28 April 2007
  • #redirect [[logarithm]]
    23 bytes (2 words) - 17:37, 28 April 2007
  • #REDIRECT [[Logarithm]]
    23 bytes (2 words) - 18:08, 28 April 2007
  • #REDIRECT[[Logarithm]]
    22 bytes (2 words) - 10:30, 25 October 2008
  • #redirect [[logarithm]]
    23 bytes (2 words) - 11:25, 25 October 2008
  • #redirect [[logarithm]]
    23 bytes (2 words) - 11:25, 25 October 2008
  • #redirect[[Fixed point of logarithm]]
    37 bytes (5 words) - 04:25, 8 March 2012
  • ...h the unknown appears both outside and inside an exponential function or a logarithm.
    152 bytes (22 words) - 10:36, 24 January 2009
  • The (m + 1)th derivative of the logarithm of the gamma function.
    101 bytes (14 words) - 10:53, 4 September 2009
  • '''[[Fixed point]]s of [[logarithm]]''' to base <math>b</math> are solutions <math>L</math> of equation ...unction that expresses one of these solutions <math>L_1</math> through the logarithm of the base <math>b</math>
    3 KB (424 words) - 14:32, 9 September 2020
  • ...] code that defines function [[Filog]] that evaluates the [[fixed point of logarithm]] // for given complex value of logarithm of its base. The Filog(z) returns soluiton <math>L</math> of the equation
    2 KB (282 words) - 08:55, 2 October 2013
  • ...se it has cutline at the negative part of the real axis. However, the same logarithm becomes
    839 bytes (128 words) - 10:05, 10 October 2013
  • ...ber of primes up to some limit ''X'' is asymptotic to ''X'' divided by the logarithm of ''X''.
    137 bytes (22 words) - 10:56, 13 November 2008
  • * In [[logarithm]]s, the base is the quantity raised to the power of the logarithm to return the given number.
    885 bytes (138 words) - 19:39, 31 January 2009
  • ...Mathematical]] functions built from a finite number of [[exponential]]s, [[logarithm]]s, [[Constant (mathematics)|constant]]s, one [[Variable (mathematics)|vari
    368 bytes (40 words) - 14:18, 25 October 2008
  • {{r|Discrete logarithm}}
    201 bytes (27 words) - 11:59, 15 June 2009
  • {{r|logarithm}}
    132 bytes (16 words) - 08:13, 14 January 2009
  • <noinclude>{{Subpages}}</noinclude>A graph of the complex logarithm of the [[transfer function]] of a linear, time-invariant system plotted wit
    309 bytes (48 words) - 20:30, 3 June 2011
  • {{r|Logarithm}}
    307 bytes (40 words) - 11:59, 15 June 2009
  • {{r|Discrete logarithm}}
    237 bytes (29 words) - 08:06, 14 January 2009
  • ...transcendental number|transcendental]], ''e'' is the base of the [[natural logarithm]]s. Its inverse, the [[exponential function]] ...t" in honor of the Scottish mathematician [[John Napier]] who introduced [[logarithm]]s.
    3 KB (527 words) - 12:19, 16 March 2008
  • {{r|Logarithm}}
    203 bytes (25 words) - 18:31, 26 October 2008
  • {{r|Logarithm}}
    209 bytes (24 words) - 10:53, 6 November 2008
  • {{r|Logarithm}}
    696 bytes (88 words) - 23:46, 23 May 2010
  • {{r|Discrete logarithm}}
    483 bytes (61 words) - 19:50, 11 January 2010
  • ...st basic [[transcendental functions]]: the [[exponential function]], the [[logarithm]], the [[trigonometric function|trigonometric functions]], and the [[hyperb ====Logarithm====
    8 KB (1,289 words) - 13:46, 26 May 2009
  • {{r|Logarithm}}
    626 bytes (80 words) - 18:22, 11 January 2010
  • ...ichter scale''' measures the strength of an [[earthquake]]. The scale is [[logarithm]]ic, so an earthquake of magnitude 6 is ten times more powerful than one of
    636 bytes (87 words) - 09:44, 13 January 2013
  • {{r|Discrete logarithm}}
    608 bytes (77 words) - 15:58, 11 January 2010
  • {{r|Logarithm}}
    682 bytes (88 words) - 10:48, 4 October 2013
  • {{r|Discrete logarithm}}
    692 bytes (91 words) - 16:33, 11 January 2010
  • {{r|Logarithm}}
    752 bytes (97 words) - 19:32, 11 January 2010
  • {{r|Logarithm}}
    802 bytes (105 words) - 17:42, 11 January 2010
  • The fixed points of exponential and those of logarithm:
    843 bytes (106 words) - 23:11, 31 January 2009
  • {{r|Discrete logarithm}}
    762 bytes (99 words) - 17:00, 11 January 2010
  • {{r|Logarithm}}
    837 bytes (109 words) - 16:27, 11 January 2010
  • {{r|Logarithm}}
    941 bytes (125 words) - 11:34, 11 January 2010
  • {{r|Logarithm}}
    991 bytes (124 words) - 17:15, 11 January 2010
  • ...ogarithm of Weierstrass's product for the gamma function, we can write the logarithm of the gamma function in the form of a series
    3 KB (488 words) - 10:34, 13 November 2007
  • ==Fixed points of [[exponential]] and fixed points of [[logarithm]]== ...earched graphically. Fig.1 shows the graphical search of fixed points of [[logarithm]],
    10 KB (1,562 words) - 07:20, 13 November 2013
  • The inverse function of the exponential is the [[logarithm]]; for any complex <math>z\ne 0</math>, the relation holds: Exponential also can be considered as inverse of logarithm, while the imaginary part of the argument is smaller than <math>\pi</math>:
    6 KB (1,021 words) - 12:18, 11 June 2009
  • Text books explaining the real logarithm:
    924 bytes (133 words) - 08:35, 31 October 2008
  • {{r|Natural logarithm}}
    2 KB (260 words) - 08:13, 9 December 2009
  • '''Discrete logarithm''' is a problem of finding logarithms in a [[finite field]]. Given a field ...t exponentiation is relatively easy but the inverse operation, finding the logarithm, is hard. The cryptosystems are designed so that the user does only easy op
    5 KB (772 words) - 17:15, 6 August 2013
  • ...ge|GaulegExample.png|right|300px|Fig.1. Example of estimate of precision: Logarithm of residual versus number <math>N</math> of terms in the right hand side of In Fig.1, the [[decimal logarithm]] of the modulus of the residual of the appdoximation of integral with Gaus
    4 KB (630 words) - 12:32, 11 June 2009
  • (* that isustrate graphical search of [[fixed point]]s of [[logarithm]] and those of [[exponential]] *)
    2 KB (213 words) - 04:12, 31 May 2008
  • remembering that the derivative of the natural logarithm is given by Taking the exponent (the inverse function of the natural logarithm) of both sides of equation (2)
    6 KB (1,076 words) - 18:14, 27 August 2009
  • The Diffie-Hellman method is based on the [[discrete logarithm]] problem and is secure unless someone finds an efficient solution to that Given a prime p and generator g (see [[discrete logarithm]]), Alice:
    6 KB (954 words) - 05:48, 8 April 2024
  • ...per second (mm²/s) or [[centistokes]] (cSt) and '''ln''' is the [[natural logarithm]] (log<sub>e</sub>). It is important that the viscosity of each component o
    2 KB (292 words) - 02:53, 29 August 2008
  • ...al-align:-5%;"><math>c</math></font> is the logarithm. In other words, the logarithm <font style="vertical-align:-5%;"><math>c</math></font> is the [[Power law| ...address of a particular location in computer memory is equal to the base-2 logarithm (rounded upwards) of the number of possible locations. Logarithms are also
    19 KB (3,039 words) - 12:51, 7 March 2023
  • ...the complex argument. In this case, the representations through function [[Logarithm]] can be used.
    2 KB (283 words) - 09:25, 10 October 2013
  • ...iteration. It is a [[fractal]] with a [[Hausdorff dimension]] of [[Natural logarithm|ln]](2)/ln(3), which is approximately 0.63.
    2 KB (306 words) - 16:51, 31 January 2011
  • |[[Logarithm|Natural logarithm]]
    8 KB (1,184 words) - 14:58, 8 December 2009
  • also, the representation through [[exponential]] and [[logarithm]] is appropriate. However, after discovery of [[exponential]] and [[logarithm]], by default, <math>z^a</math> is interpreted as <math>\exp(a \ln(z))</ma
    8 KB (1,339 words) - 13:11, 8 August 2021
  • {{r|Logarithm}}
    3 KB (441 words) - 12:55, 13 November 2014
  • ...unknown appears both outside and inside an [[exponential function]] or a [[logarithm]], such as <math>3x+2=e^x</math> or <math>x=\ln(4x)</math>. Such equations ...he Lambert ''W'' function can be understood by comparing it to the natural logarithm, the inverse of <math>e^w</math>. For large negative or positive <math>w</m
    14 KB (2,354 words) - 21:43, 25 September 2011
  • The principal branch of the [[complex logarithm]] function is holomorphic on the [[Set (mathematics)|set]] '''C''' \ {''z'' and is therefore holomorphic wherever the logarithm log(''z'') is. The function 1/''z'' is holomorphic on {''z'' : ''z'' &ne; 0
    9 KB (1,434 words) - 15:35, 7 February 2009
  • The numbers most easily proved to be irrational are certain [[logarithm]]s. Suppose log<sub>2</sub>&nbsp;3 is rational. That implies that it can
    4 KB (666 words) - 11:23, 3 October 2009
  • ...n</math> numbers is prime (here, <math>\log n</math> denotes the [[natural logarithm]] of <math>n</math>). The formal statement of the Prime Number Theorem is
    4 KB (703 words) - 12:02, 13 November 2007
  • Take the natural logarithm and the limit for ''y'' &rarr; 0
    5 KB (796 words) - 13:09, 24 December 2008
  • ...new methods to extract the [[square root]] and to calculate the natural [[logarithm]] of a number. ...er]]s, namely [[nth root|numeric root]]s (like the [[square root]]s) and [[logarithm]]s.
    32 KB (4,192 words) - 18:42, 3 March 2024
  • :<math>e\,</math> is approximately 2.7182818, the base of the [[natural logarithm]] (also called [[Euler's number]]) Taking the [[natural logarithm]] of the formula, gives us the more commonly used formula:<ref>[http://www.
    11 KB (1,729 words) - 05:20, 3 September 2013
  • ...de plot is usually expressed as [[decibel]]s, that is, 20 times the common logarithm (20 log<sub>10</sub>) of the amplitude of the gain. ...seen as separate plots of the real and the imaginary parts of the complex logarithm of a complex gain, say ''A''(&phi;) = |''A''|e<sup>j&phi;</sup>. The Bode p
    24 KB (3,933 words) - 02:20, 14 October 2013
  • ...'Jhone Neper'' in his time. Napier is most remembered as the inventor of [[logarithm]]s and "[[Napier's bones]]", (a multiplication tool using a set of numbered ...ms but his work remained unpublished until 1620</ref>. A number, n, is the logarithm of x to "base" b if <math>\scriptstyle x\,=\, b^n</math>. For common logari
    12 KB (1,843 words) - 13:57, 29 March 2009
  • |align=left|= [[Logarithm]] on base <math>e</math> |align=left|= Logarithm on base <math>e</math>
    12 KB (1,850 words) - 12:25, 30 April 2012
  • [[square root]], [[logarithm]], [[function Gamma]], [[tetration]].
    6 KB (827 words) - 14:44, 19 December 2008
  • |align=left|= the [[natural logarithm]] to the base [[e (mathematics)|e]] As can be seen from the above plot of the logarithm of the vapor pressure vs. the temperature for any given pure [[chemical com
    15 KB (2,372 words) - 00:31, 28 October 2013
  • |align=left|= the [[natural logarithm]] to the base [[e (mathematics)|e]] As can be seen from the above plot of the logarithm of the vapor pressure vs. the temperature for any given pure [[chemical com
    15 KB (2,373 words) - 19:13, 5 August 2018
  • ...can be omitted, as in the case of tetration, arctetration, exponential and logarithm. The [[natural pentation]] is
    8 KB (1,169 words) - 01:26, 9 September 2014
  • The exponential convergence of discrete iteration of logarithm corresponds to the exponential asymptotic behavior and <math>L</math> is eigenvalue of logarithm, solution of equation
    65 KB (10,203 words) - 04:16, 8 September 2014
  • '''Example.''' Consider the equation <math>e^s = x</math>. The ''logarithm of x'' is defined as the number ''s'' which satisfies the equation. ([[Madhava of Sangamagramma]], around 1400; [[James Gregory]], 1671); for [[logarithm]],
    15 KB (2,342 words) - 06:26, 30 November 2011
  • ...ed by the following equation (which can be derived by taking the natural [[logarithm]] of the above): ...o [[Stimulus (physiology)|stimuli]], including human [[perception]], are [[logarithm|logarithmic]] responses, which are the inverse of exponential responses; th
    14 KB (2,099 words) - 13:37, 10 April 2024
  • where ln(''P''<sub>2</sub>/''P''<sub>1</sub>) is the natural (base ''e'') [[logarithm]] of ''P''<sub>2</sub>/''P''<sub>1</sub>. We reiterate that for a gas-liqui
    9 KB (1,442 words) - 18:43, 19 February 2010
  • The function "ln ''x''" is the [[natural logarithm]] (base e) of ''x'', and the function "exp ''x''" is e (approximately 2.718 |align=left|= the base of the natural logarithm = 2.7183
    19 KB (3,081 words) - 13:47, 12 August 2013
  • The function "ln ''x''" is the [[natural logarithm]] (base e) of ''x'', and the function "exp ''x''" is e (approximately 2.718 |align=left|= the base of the natural logarithm = 2.7183
    19 KB (3,099 words) - 10:42, 8 April 2024
  • ...Any combination of sums, products, powers, [[exponential function]]s or [[logarithm]]s with a fixed number of terms will not suffice to express <math>n!</math> ...ot an integer.<ref>Everywhere in this article, "log" denotes the [[natural logarithm]].</ref> Using standard theorems from [[mathematical analysis]], it can be
    32 KB (5,024 words) - 12:05, 22 December 2008
  • ...tion]] problem, while Diffie-Hellman and DSA are related to the [[discrete logarithm]] problem. More recently, [[elliptic curve cryptography]] has developed in
    8 KB (1,233 words) - 05:48, 8 April 2024
  • ...c [[reference electrode]]. The voltage is theoretically dependent on the [[logarithm]] of the ionic activity, according to the [[Nernst equation]]. Ion-selectiv
    9 KB (1,439 words) - 13:28, 18 May 2010
  • Studies that report benefit use the natural logarithm transformation of the CRP and measure the net reclassification rate rather The natural logarithm transformation of the CRP is part of the Reynolds score which has been prop
    18 KB (2,464 words) - 12:46, 2 May 2024
  • ...pressures in [[Pressure|mmHg]] when using <math>\log_{10}</math> as the [[Logarithm|logarithmic function]].
    9 KB (1,383 words) - 09:41, 29 June 2023
  • * [[logarithm]] (which is a different function)
    9 KB (1,454 words) - 08:23, 18 October 2013
  • Statisticians may transform data by taking the logarithm, square root, reciprocal, or other function if the data does not fit a norm
    9 KB (1,291 words) - 04:36, 27 June 2009
  • The [[cumulant]] generating function is the logarithm of the moment generating function: ''g''(''t'') = μ''t'' + σ<sup>2</sup>' It is conventional to denote the "loglikelihood function", i.e., the logarithm of the likelihood function, by a lower-case <math>\ell</math>, and we have
    46 KB (6,956 words) - 07:01, 9 June 2009
  • ...problems, such as the [[integer factorisation]] problem or the [[discrete logarithm]] problem. In many cases, there are proofs that cryptographic techniques a
    9 KB (1,312 words) - 05:49, 8 April 2024
  • ...than 7 and the pH of a basic solution is greater than 7. The pH scale is [[logarithm]]ic which means that a difference of one pH unit is equivalent to a ten-fol
    11 KB (1,606 words) - 09:39, 29 June 2023
  • ...teger factorisation]], the [[Diffie-Hellman]] protocol from the [[discrete logarithm]] problem, and other systems from various [[elliptic curve]] problems. In a ...e [[elliptic curve cryptography|elliptic curve-based]] version of discrete logarithm are much more time-consuming than the best known algorithms for factoring,
    32 KB (4,913 words) - 14:38, 18 March 2024
  • ...teger factorisation]], the [[Diffie-Hellman]] protocol from the [[discrete logarithm]] problem, and other systems from various [[elliptic curve]] problems. In a ...e [[elliptic curve cryptography|elliptic curve-based]] version of discrete logarithm are much more time-consuming than the best known algorithms for factoring,
    32 KB (4,916 words) - 05:49, 8 April 2024
  • == Math editors -- look at these math pages ([[Logarithm]] and [[Lambert W function]]) == I would appreciate it if an editor would look at [[Logarithm]] and comment on what's needed to bring it up to approval level, and whethe
    44 KB (7,312 words) - 03:09, 8 March 2024
  • ...rs is prime (here, <math>\scriptstyle\log\, n</math> denotes the [[natural logarithm]] of <math>n</math>). The formal statement of the prime number theorem is
    14 KB (2,281 words) - 12:20, 13 September 2013
  • where we used the rules [[logarithm|ln]](''a''/''b'') = ln''a'' - ln''b'' and ln''a''<sup>n</sup> = n ln''a''.
    14 KB (2,204 words) - 15:26, 20 November 2022
  • LogFactorial can be interpreted as logarithm of factorial, id est,
    22 KB (3,358 words) - 09:31, 10 October 2013
  • Statisticians may transform data by taking the logarithm, square root, reciprocal, or other function if the data does not fit a norm
    15 KB (2,373 words) - 12:26, 20 February 2021
  • ...rs is prime (here, <math>\scriptstyle\log\, n</math> denotes the [[natural logarithm]] of <math>n</math>). The formal statement of the prime number theorem is
    18 KB (2,917 words) - 10:27, 30 August 2014
  • <math>L^*</math> of natural logarithm. At <math>c\!\ge\! 0</math>, function <math>\exp^c(z)</math> remains [[holo
    21 KB (3,134 words) - 09:12, 10 October 2013
  • *e: the [[Logarithm#Bases and notational variants|base of the natural logarithms]]
    15 KB (2,383 words) - 14:30, 13 January 2017
  • ...se to [[Galois theory]]. [[Joseph Liouville]] (1840) showed that neither [[logarithm|e]] nor <math>e^2</math> can be a root of an integer [[quadratic equation]]
    19 KB (2,948 words) - 10:07, 28 February 2024
  • ...ty of states is considerably larger than the density of impurities, so the logarithm is negative, placing the Fermi level below the conduction band edge.
    19 KB (3,143 words) - 05:30, 9 September 2011
  • where log is the natural (base ''e'') [[logarithm]]. The entropy of an ideal gas is a logarithmic function of its volume.
    21 KB (3,684 words) - 10:27, 8 July 2019
  • ...t the argument of the logarithm lies between zero and unity, and hence the logarithm is negative and so is the entropy change of ''A'' + ''B''. </ref>
    35 KB (5,595 words) - 12:26, 6 September 2013
  • ...t the argument of the logarithm lies between zero and unity, and hence the logarithm is negative and so is the entropy change of ''A'' + ''B''. </ref>
    35 KB (5,571 words) - 12:27, 6 September 2013
  • ...h an early interest in mathematics. When he was 10 years old he bought a [[logarithm]] table of his pocket money and taught himself how to calculate with it.
    18 KB (2,830 words) - 08:31, 11 September 2023
  • ...he more acidic it is). As shown in the adjacent diagram, the pH scale is [[logarithm|logarithmic]] and ranges from 0 (strongly acidic) to 14 (strongly alkaline
    26 KB (3,985 words) - 09:16, 6 March 2024
  • ...he more acidic it is). As shown in the adjacent diagram, the pH scale is [[logarithm|logarithmic]] and ranges from 0 (strongly acidic) to 14 (strongly alkaline
    26 KB (3,984 words) - 08:07, 15 March 2024
  • ...[Inverse trigonometric function]]. Using the [[complex number|complex]] [[logarithm]], one can generalize all these functions to complex arguments:
    33 KB (5,179 words) - 08:26, 4 June 2010
  • ...er values of ''n'' in the range 1 - 128. Here ''log<sub>2</sub>'' is the [[logarithm]] of its argument to the base 2. With these formulas, middle ''C'' with MI
    30 KB (4,652 words) - 02:22, 27 October 2013
  • .... The organization in octaves and so the percept of pitch differences is [[Logarithm|logarithmic]]: The perceived difference between a 220 Hz and 440 Hz tone is
    25 KB (3,720 words) - 17:01, 21 March 2024
  • ...nn's constant]] and the function log stands for the natural (base ''e'') [[logarithm]]. ''&Omega;'' is the number of different wave functions ("microstates") o
    36 KB (5,928 words) - 10:21, 8 July 2019
  • ...theorists sometimes represent pitches using a numerical scale based on the logarithm of fundamental frequency. For example, one can adopt the widely used [[MID
    32 KB (5,025 words) - 10:07, 28 February 2024
  • ...he entire conversation cannot learn the key. It is based on the [[discrete logarithm]] problem and is therefore thought to be secure. Mathematicians have been w
    40 KB (6,219 words) - 05:49, 8 April 2024
  • :'''1610-1621''': Andrew Hart publishes [[John Napier|Napier]]'s book of [[logarithm|logs]]
    32 KB (4,935 words) - 07:32, 20 April 2024
  • ...mathematical problem &mdash; [[integer factorisation]] for RSA, [[discrete logarithm]] for Diffie-Hellman, and so on. These problems are generally thought to be
    52 KB (8,332 words) - 05:49, 8 April 2024