enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Autovivification - Wikipedia

    en.wikipedia.org/wiki/Autovivification

    Python's built-in dict class can be subclassed to implement autovivificious dictionaries simply by overriding the __missing__() method that was added to the class in Python v2.5. [5] There are other ways of implementing the behavior, [ 6 ] [ 7 ] but the following is one of the simplest and instances of the class print just like normal Python ...

  3. File:A Byte of Python.pdf - Wikipedia

    en.wikipedia.org/wiki/File:A_Byte_of_Python.pdf

    You are free: to share – to copy, distribute and transmit the work; to remix – to adapt the work; Under the following conditions: attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made.

  4. Discrete logarithm - Wikipedia

    en.wikipedia.org/wiki/Discrete_logarithm

    For example, log 10 10000 = 4, and log 10 0.001 = −3. These are instances of the discrete logarithm problem. Other base-10 logarithms in the real numbers are not instances of the discrete logarithm problem, because they involve non-integer exponents. For example, the equation log 10 53 = 1.724276… means that 10 1.724276… = 53.

  5. Complex logarithm - Wikipedia

    en.wikipedia.org/wiki/Complex_logarithm

    Rays emanating from 0 in the z-plane are mapped to horizontal lines in the w-plane. Each circle and ray in the z-plane as above meet at a right angle. Their images under Log are a vertical segment and a horizontal line (respectively) in the w-plane, and these too meet at a right angle. This is an illustration of the conformal property of Log.

  6. Iterated logarithm - Wikipedia

    en.wikipedia.org/wiki/Iterated_logarithm

    The zig-zagging entails starting from the point (n, 0) and iteratively moving to (n, log b (n) ), to (0, log b (n) ), to (log b (n), 0 ). In computer science , the iterated logarithm of n {\displaystyle n} , written log * n {\displaystyle n} (usually read " log star "), is the number of times the logarithm function must be iteratively applied ...

  7. File:Think Python.pdf - Wikipedia

    en.wikipedia.org/wiki/File:Think_Python.pdf

    English: PDF version of the Think Python Wikibook. This file was created with MediaWiki to LaTeX . The LaTeX source code is attached to the PDF file (see imprint).

  8. 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.

  9. Pollard's rho algorithm for logarithms - Wikipedia

    en.wikipedia.org/wiki/Pollard's_rho_algorithm_for...

    Let be a cyclic group of order , and given ,, and a partition =, let : be the map = {and define maps : and : by (,) = {() + (,) = {+ ()input: a: a generator of G b: an element of G output: An integer x such that a x = b, or failure Initialise i ← 0, a 00, b 00, x 0 ← 1 ∈ G loop i ← i + 1 x i ← f(x i−1), a i ← g(x i−1, a i−1), b i ← h(x i−1, b i−1) x 2i−1 ← ...