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

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

  5. Dirichlet convolution - Wikipedia

    en.wikipedia.org/wiki/Dirichlet_convolution

    The restriction of the divisors in the convolution to unitary, bi-unitary or infinitary divisors defines similar commutative operations which share many features with the Dirichlet convolution (existence of a Möbius inversion, persistence of multiplicativity, definitions of totients, Euler-type product formulas over associated primes, etc.).

  6. Unitary divisor - Wikipedia

    en.wikipedia.org/wiki/Unitary_divisor

    A divisor d of n is a bi-unitary divisor if the greatest common unitary divisor of d and n/d is 1. This concept originates from D. Suryanarayana (1972). [The number of bi-unitary divisors of an integer, in The Theory of Arithmetic Functions, Lecture Notes in Mathematics 251: 273–282, New York, Springer–Verlag].

  7. Arithmetic function - Wikipedia

    en.wikipedia.org/wiki/Arithmetic_function

    An example of an arithmetic function is the divisor function whose value at a positive integer n is equal to the number of divisors of n. Arithmetic functions are often extremely irregular (see table), but some of them have series expansions in terms of Ramanujan's sum.

  8. Friendly number - Wikipedia

    en.wikipedia.org/wiki/Friendly_number

    Abundancy may also be expressed as () where denotes a divisor function with () equal to the sum of the k-th powers of the divisors of n. The numbers 1 through 5 are all solitary. The smallest friendly number is 6, forming for example, the friendly pair 6 and 28 with abundancy σ(6) / 6 = (1+2+3+6) / 6 = 2, the same as σ(28) / 28 = (1+2+4+7+14 ...

  9. Division (mathematics) - Wikipedia

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

    Apart from division by zero being undefined, the quotient is not an integer unless the dividend is an integer multiple of the divisor. For example, 26 cannot be divided by 11 to give an integer. Such a case uses one of five approaches: Say that 26 cannot be divided by 11; division becomes a partial function.