When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Unitary divisor - Wikipedia

    en.wikipedia.org/wiki/Unitary_divisor

    The number of bi-unitary divisors of n is a multiplicative function of n with average order ⁡ where [3] = ((+)) . A bi-unitary perfect number is one equal to the sum of its bi-unitary aliquot divisors. The only such numbers are 6, 60 and 90.

  3. Table of prime factors - Wikipedia

    en.wikipedia.org/wiki/Table_of_prime_factors

    An economical number has been defined as a frugal number, but also as a number that is either frugal or equidigital. gcd( m , n ) ( greatest common divisor of m and n ) is the product of all prime factors which are both in m and n (with the smallest multiplicity for m and n ).

  4. Table of divisors - Wikipedia

    en.wikipedia.org/wiki/Table_of_divisors

    For example, 3 is a divisor of 21, since 21/7 = 3 (and therefore 7 is also a divisor of 21). If m is a divisor of n , then so is − m . The tables below only list positive divisors.

  5. Multiply perfect number - Wikipedia

    en.wikipedia.org/wiki/Multiply_perfect_number

    A divisor d of a positive integer n is called a bi-unitary divisor of n if the greatest common unitary divisor (gcud) of d and n/d equals 1. This concept is due to D. Surynarayana (1972). The sum of the (positive) bi-unitary divisors of n is denoted by σ ** (n). Peter Hagis (1987) proved that there are no odd bi-unitary multiperfect numbers ...

  6. Unitary perfect number - Wikipedia

    en.wikipedia.org/wiki/Unitary_perfect_number

    A unitary perfect number is an integer which is the sum of its positive proper unitary divisors, not including the number itself. (A divisor d of a number n is a unitary divisor if d and n/d share no common factors). The number 6 is the only number that is both a perfect number and a unitary perfect number.

  7. Superperfect number - Wikipedia

    en.wikipedia.org/wiki/Superperfect_number

    If n is an even superperfect number, then n must be a power of 2, 2 k, such that 2 k+11 is a Mersenne prime. [1] [2] It is not known whether there are any odd superperfect numbers. An odd superperfect number n would have to be a square number such that either n or σ(n) is divisible by at least three distinct primes. [2]

  8. Hall subgroup - Wikipedia

    en.wikipedia.org/wiki/Hall_subgroup

    The easiest way to find the Hall divisors is to write the prime power factorization of the number in question and take any subset of the factors. For example, to find the Hall divisors of 60, its prime power factorization is 2 2 × 3 × 5, so one takes any product of 3, 2 2 = 4, and 5. Thus, the Hall divisors of 60 are 1, 3, 4, 5, 12, 15, 20 ...

  9. Egyptian fraction - Wikipedia

    en.wikipedia.org/wiki/Egyptian_fraction

    If the number is not already a unit fraction, the first method in this list is to attempt to split the numerator into a sum of divisors of the denominator; this is possible whenever the denominator is a practical number, and Liber Abaci includes tables of expansions of this type for the practical numbers 6, 8, 12, 20, 24, 60, and 100.