enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. 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 ...

  3. Sociable number - Wikipedia

    en.wikipedia.org/wiki/Sociable_number

    In a sociable sequence, each number is the sum of the proper divisors of the preceding number, i.e., the sum excludes the preceding number itself. For the sequence to be sociable, the sequence must be cyclic and return to its starting point. The period of the sequence, or order of the set of sociable numbers, is the number of numbers in this cycle.

  4. List of number theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_number_theory_topics

    Almost perfect number; Amicable number; Betrothed numbers; Deficient number; Quasiperfect number; Perfect number; Sociable number; Collatz conjecture; Digit sum dynamics Additive persistence; Digital root; Digit product dynamics Multiplicative digital root; Multiplicative persistence; Lychrel number; Perfect digital invariant. Happy number

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

  6. Meertens number - Wikipedia

    en.wikipedia.org/wiki/Meertens_number

    A Meertens number is a sociable Meertens number with =, and a amicable Meertens number is a sociable Meertens number with =. The number of iterations i {\displaystyle i} needed for F b i ( n ) {\displaystyle F_{b}^{i}(n)} to reach a fixed point is the Meertens function's persistence of n {\displaystyle n} , and undefined if it never reaches a ...

  7. Talk:Betrothed numbers - Wikipedia

    en.wikipedia.org/wiki/Talk:Betrothed_numbers

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more

  8. List of integer sequences - Wikipedia

    en.wikipedia.org/wiki/List_of_integer_sequences

    A number that has fewer digits than the number of digits in its prime factorization (including exponents). A046760: Pandigital numbers: 1023456789, 1023456798, 1023456879, 1023456897, 1023456978, 1023456987, 1023457689, 1023457698, 1023457869, 1023457896, ... Numbers containing the digits 0–9 such that each digit appears exactly once. A050278

  9. Interesting number paradox - Wikipedia

    en.wikipedia.org/wiki/Interesting_number_paradox

    Famously, in a discussion between the mathematicians G. H. Hardy and Srinivasa Ramanujan about interesting and uninteresting numbers, Hardy remarked that the number 1729 of the taxicab he had ridden seemed "rather a dull one", and Ramanujan immediately answered that it is interesting, being the smallest number that is the sum of two cubes in ...