enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Rhind Mathematical Papyrus - Wikipedia

    en.wikipedia.org/wiki/Rhind_Mathematical_Papyrus

    The Rhind Mathematical Papyrus (RMP; also designated as papyrus British Museum 10057, pBM 10058, and Brooklyn Museum 37.1784Ea-b) is one of the best known examples of ancient Egyptian mathematics. It is one of two well-known mathematical papyri, along with the Moscow Mathematical Papyrus. The Rhind Papyrus is the larger, but younger, of the two..

  3. Convolutional code - Wikipedia

    en.wikipedia.org/wiki/Convolutional_code

    Convolutional code. In telecommunication, a convolutional code is a type of error-correcting code that generates parity symbols via the sliding application of a boolean polynomial function to a data stream. The sliding application represents the 'convolution' of the encoder over the data, which gives rise to the term 'convolutional coding'.

  4. Farey sequence - Wikipedia

    en.wikipedia.org/wiki/Farey_sequence

    In mathematics, the Farey sequence of order n is the sequence of completely reduced fractions, either between 0 and 1, or without this restriction, [ a] which when in lowest terms have denominators less than or equal to n, arranged in order of increasing size. With the restricted definition, each Farey sequence starts with the value 0, denoted ...

  5. Ratio - Wikipedia

    en.wikipedia.org/wiki/Ratio

    Ratio. In mathematics, a ratio (/ ˈreɪʃ (i) oʊ /) shows how many times one number contains another. For example, if there are eight oranges and six lemons in a bowl of fruit, then the ratio of oranges to lemons is eight to six (that is, 8:6, which is equivalent to the ratio 4:3). Similarly, the ratio of lemons to oranges is 6:8 (or 3:4) and ...

  6. List of Runge–Kutta methods - Wikipedia

    en.wikipedia.org/wiki/List_of_Runge–Kutta_methods

    List of Runge–Kutta methods. Runge–Kutta methods are methods for the numerical solution of the ordinary differential equation. Explicit Runge–Kutta methods take the form. Stages for implicit methods of s stages take the more general form, with the solution to be found over all s. Each method listed on this page is defined by its Butcher ...

  7. Geometric series - Wikipedia

    en.wikipedia.org/wiki/Geometric_series

    A two dimensional geometric series diagram Nicole Oresme used to determine that the infinite series 1/2 + 2/4 + 3/8 + 4/16 + 5/32 + 6/64 + 7/128 + ... converges to 2. In addition to his elegantly simple proof of the divergence of the harmonic series, Nicole Oresme [9] proved that the series

  8. RC time constant - Wikipedia

    en.wikipedia.org/wiki/RC_time_constant

    The RC time constant, denoted τ (lowercase tau), the time constant (in seconds) of a resistor–capacitor circuit (RC circuit), is equal to the product of the circuit resistance (in ohms) and the circuit capacitance (in farads): It is the time required to charge the capacitor, through the resistor, from an initial charge voltage of zero to ...

  9. Information gain (decision tree) - Wikipedia

    en.wikipedia.org/wiki/Information_gain_(decision...

    Information gain (decision tree) In information theory and machine learning, information gain is a synonym for Kullback–Leibler divergence; the amount of information gained about a random variable or signal from observing another random variable. However, in the context of decision trees, the term is sometimes used synonymously with mutual ...