When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Pentagonal number theorem - Wikipedia

    en.wikipedia.org/wiki/Pentagonal_number_theorem

    In summary, it has been shown that partitions into an even number of distinct parts and an odd number of distinct parts exactly cancel each other, producing null terms 0x n, except if n is a generalized pentagonal number = = /, in which case there is exactly one Ferrers diagram left over, producing a term (−1) k x n. But this is precisely ...

  3. Euler numbers - Wikipedia

    en.wikipedia.org/wiki/Euler_numbers

    The Euler numbers appear in the Taylor series expansions of the secant and hyperbolic secant functions. The latter is the function in the definition. The latter is the function in the definition. They also occur in combinatorics , specifically when counting the number of alternating permutations of a set with an even number of elements.

  4. Particular values of the Riemann zeta function - Wikipedia

    en.wikipedia.org/wiki/Particular_values_of_the...

    For the even positive integers , one has the relationship to the Bernoulli numbers: = + (!). The computation of () is known as the Basel problem.The value of () is related to the Stefan–Boltzmann law and Wien approximation in physics.

  5. Collatz conjecture - Wikipedia

    en.wikipedia.org/wiki/Collatz_conjecture

    The number is taken to be 'odd' or 'even' according to whether its numerator is odd or even. Then the formula for the map is exactly the same as when the domain is the integers: an 'even' such rational is divided by 2; an 'odd' such rational is multiplied by 3 and then 1 is added.

  6. Bernoulli number - Wikipedia

    en.wikipedia.org/wiki/Bernoulli_number

    In mathematics, the Bernoulli numbers B n are a sequence of rational numbers which occur frequently in analysis.The Bernoulli numbers appear in (and can be defined by) the Taylor series expansions of the tangent and hyperbolic tangent functions, in Faulhaber's formula for the sum of m-th powers of the first n positive integers, in the Euler–Maclaurin formula, and in expressions for certain ...

  7. Bernoulli polynomials - Wikipedia

    en.wikipedia.org/wiki/Bernoulli_polynomials

    In mathematics, the Bernoulli polynomials, named after Jacob Bernoulli, combine the Bernoulli numbers and binomial coefficients. They are used for series expansion of functions, and with the Euler–MacLaurin formula. These polynomials occur in the study of many special functions and, in particular, the Riemann zeta function and the Hurwitz ...

  8. Binomial distribution - Wikipedia

    en.wikipedia.org/wiki/Binomial_distribution

    The notation in the formula below differs from the previous formulas in two respects: [26] Firstly, z x has a slightly different interpretation in the formula below: it has its ordinary meaning of 'the x th quantile of the standard normal distribution', rather than being a shorthand for 'the (1 − x) th quantile'.

  9. Partition function (number theory) - Wikipedia

    en.wikipedia.org/wiki/Partition_function_(number...

    The function q(n) gives the number of these strict partitions of the given sum n. For example, q(3) = 2 because the partitions 3 and 1 + 2 are strict, while the third partition 1 + 1 + 1 of 3 has repeated parts. The number q(n) is also equal to the number of partitions of n in which only odd summands are permitted. [20]