enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Amicable numbers - Wikipedia

    en.wikipedia.org/wiki/Amicable_numbers

    In mathematics, the amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number. That is, s ( a )= b and s ( b )= a , where s ( n )=σ( n )- n is equal to the sum of positive divisors of n except n itself (see also divisor function ).

  3. Amenable number - Wikipedia

    en.wikipedia.org/wiki/Amenable_number

    An amenable number is a positive integer for which there exists a multiset of as many integers as the original number that both add up to the original number and when multiplied together give the original number.

  4. Friendly number - Wikipedia

    en.wikipedia.org/wiki/Friendly_number

    A number that is not part of any friendly pair is called solitary. The abundancy index of n is the rational number σ(n) / n, in which σ denotes the sum of divisors function. A number n is a friendly number if there exists m ≠ n such that σ(m) / m = σ(n) / n. Abundancy is not the same as abundance, which is defined as σ(n) − 2n.

  5. Amicable triple - Wikipedia

    en.wikipedia.org/wiki/Amicable_triple

    In mathematics, an amicable triple is a set of three different numbers so related that the restricted sum of the divisors of each is equal to the sum of other two numbers. [ 1 ] [ 2 ] In another equivalent characterization, an amicable triple is a set of three different numbers so related that the sum of the divisors of each is equal to the sum ...

  6. Aliquot sequence - Wikipedia

    en.wikipedia.org/wiki/Aliquot_sequence

    The aliquot sequence starting with a positive integer k can be defined formally in terms of the sum-of-divisors function σ 1 or the aliquot sum function s in the following way: [1] = = = > = = = If the s n-1 = 0 condition is added, then the terms after 0 are all 0, and all aliquot sequences would be infinite, and we can conjecture that all aliquot sequences are convergent, the limit of these ...

  7. Sociable number - Wikipedia

    en.wikipedia.org/wiki/Sociable_number

    The period of the sequence, or order of the set of sociable numbers, is the number of numbers in this cycle. If the period of the sequence is 1, the number is a sociable number of order 1, or a perfect number—for example, the proper divisors of 6 are 1, 2, and 3, whose sum is again 6. A pair of amicable numbers is a set of sociable numbers of ...

  8. Betrothed numbers - Wikipedia

    en.wikipedia.org/wiki/Betrothed_numbers

    Quasi-sociable numbers or reduced sociable numbers are numbers whose aliquot sums minus one form a cyclic sequence that begins and ends with the same number. They are generalizations of the concepts of betrothed numbers and quasiperfect numbers. The first quasi-sociable sequences, or quasi-sociable chains, were discovered by Mitchell Dickerman ...

  9. Cuisenaire rods - Wikipedia

    en.wikipedia.org/wiki/Cuisenaire_rods

    Cuisenaire rods illustrating the factors of ten A demonstration the first pair of amicable numbers, (220,284). Cuisenaire rods are mathematics learning aids for pupils that provide an interactive, hands-on [1] way to explore mathematics and learn mathematical concepts, such as the four basic arithmetical operations, working with fractions and finding divisors.