enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Mirifici Logarithmorum Canonis Descriptio - Wikipedia

    en.wikipedia.org/wiki/Mirifici_Logarithmorum...

    [1]: p. 35 The proportion along the top rows, starting with 1 is 0.99. The entries in each column are in proportion 0.9995. (Note that 0.9995 = 1-1/2000, allowing "tolerably easy" multiplication by halving, shifting and subtracting.) Napier uses the first column to computing the logarithm of .99, using log of .9995, which he already has.

  3. Logarithmic scale - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_scale

    Examples of equally spaced values are 10, 100, 1000, 10000, and 100000 (i.e., 10 1, 10 2, 10 3, 10 4, 10 5) and 2, 4, 8, 16, and 32 (i.e., 2 1, 2 2, 2 3, 2 4, 2 5). Exponential growth curves are often depicted on a logarithmic scale graph. A logarithmic scale from 0.1 to 100 The two logarithmic scales of a slide rule

  4. Logarithmic decrement - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_decrement

    The logarithmic decrement can be obtained e.g. as ln(x 1 /x 3).Logarithmic decrement, , is used to find the damping ratio of an underdamped system in the time domain.. The method of logarithmic decrement becomes less and less precise as the damping ratio increases past about 0.5; it does not apply at all for a damping ratio greater than 1.0 because the system is overdamped.

  5. Log-normal distribution - Wikipedia

    en.wikipedia.org/wiki/Log-normal_distribution

    A probability distribution is not uniquely determined by the moments E[X n] = e nμ + ⁠ 1 / 2 ⁠ n 2 σ 2 for n ≥ 1. That is, there exist other distributions with the same set of moments. [ 4 ] In fact, there is a whole family of distributions with the same moments as the log-normal distribution.

  6. Primitive root modulo n - Wikipedia

    en.wikipedia.org/wiki/Primitive_root_modulo_n

    The remainders in the period, which are 3, 2, 6, 4, 5, 1, form a rearrangement of all nonzero remainders modulo 7, implying that 3 is indeed a primitive root modulo 7. This derives from the fact that a sequence ( g k modulo n ) always repeats after some value of k , since modulo n produces a finite number of values.

  7. History of logarithms - Wikipedia

    en.wikipedia.org/wiki/History_of_logarithms

    Napier then calculated the products of these numbers with 10 7 (1 − 10 −5) L for L from 1 to 50, and did similarly with 0.9998 ≈ (1 − 10 −5) 20 and 0.9 ≈ 0.995 20. [32] These computations, which occupied 20 years, allowed him to give, for any number N from 5 to 10 million, the number L that solves the equation

  8. Division (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Division_(mathematics)

    This is denoted as 20 / 5 = 4, or ⁠ 20 / 5 ⁠ = 4. [2] In the example, 20 is the dividend, 5 is the divisor, and 4 is the quotient. Unlike the other basic operations, when dividing natural numbers there is sometimes a remainder that will not go evenly into the dividend; for example, 10 / 3 leaves a remainder of 1, as 10 is not a multiple of 3.

  9. Nested radical - Wikipedia

    en.wikipedia.org/wiki/Nested_radical

    In the case of two nested square roots, the following theorem completely solves the problem of denesting. [2]If a and c are rational numbers and c is not the square of a rational number, there are two rational numbers x and y such that + = if and only if is the square of a rational number d.