When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Divisor function - Wikipedia

    en.wikipedia.org/wiki/Divisor_function

    When z is 1, the function is called the sigma function or sum-of-divisors function, [1] [3] and the subscript is often omitted, so σ(n) is the same as σ 1 (n) (OEIS: A000203). The aliquot sum s ( n ) of n is the sum of the proper divisors (that is, the divisors excluding n itself, OEIS : A001065 ), and equals σ 1 ( n ) − n ; the aliquot ...

  3. Category:Divisor function - Wikipedia

    en.wikipedia.org/wiki/Category:Divisor_function

    Pages in category "Divisor function" The following 28 pages are in this category, out of 28 total. This list may not reflect recent changes. ...

  4. Divisor summatory function - Wikipedia

    en.wikipedia.org/wiki/Divisor_summatory_function

    In number theory, the divisor summatory function is a function that is a sum over the divisor function. It frequently occurs in the study of the asymptotic behaviour of the Riemann zeta function . The various studies of the behaviour of the divisor function are sometimes called divisor problems .

  5. List of number theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_number_theory_topics

    Multiplicative function; Additive function; Dirichlet convolution; ErdÅ‘s–Kac theorem; Möbius function. Möbius inversion formula; Divisor function; Liouville function; Partition function (number theory) Integer partition; Bell numbers; Landau's function; Pentagonal number theorem; Bell series; Lambert series

  6. Colossally abundant number - Wikipedia

    en.wikipedia.org/wiki/Colossally_abundant_number

    Sigma function σ 1 (n) up to n = 250 Prime-power factors. In number theory, a colossally abundant number (sometimes abbreviated as CA) is a natural number that, in a particular, rigorous sense, has many divisors. Particularly, it is defined by a ratio between the sum of an integer's divisors and that integer raised to a power higher than one ...

  7. Average order of an arithmetic function - Wikipedia

    en.wikipedia.org/wiki/Average_order_of_an...

    In a similar way, If f and g are two polynomial arithmetic functions, one defines f * g, the Dirichlet convolution of f and g, by () = () = = () where the sum extends over all monic divisors d of m, or equivalently over all pairs (a, b) of monic polynomials whose product is m.

  8. Divisor - Wikipedia

    en.wikipedia.org/wiki/Divisor

    A divisor of that is not a trivial divisor is known as a non-trivial divisor (or strict divisor [6]). A nonzero integer with at least one non-trivial divisor is known as a composite number , while the units −1 and 1 and prime numbers have no non-trivial divisors.

  9. List of mathematical functions - Wikipedia

    en.wikipedia.org/wiki/List_of_mathematical_functions

    Thomae's function: is a function that is continuous at all irrational numbers and discontinuous at all rational numbers. It is also a modification of Dirichlet function and sometimes called Riemann function. Kronecker delta function: is a function of two variables, usually integers, which is 1 if they are equal, and 0 otherwise.