enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Betrothed_numbers

    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 in 1997: 1215571544 = 2^3*11*13813313; 1270824975 = 3^2*5^2*7*19*42467; 1467511664 = 2^4*19*599*8059; 1530808335 = 3^3*5*7*1619903; 1579407344 = 2^4*31^2*59*1741

  3. Amicable numbers - Wikipedia

    en.wikipedia.org/wiki/Amicable_numbers

    Sociable numbers are the numbers in cyclic lists of numbers (with a length greater than 2) where each number is the sum of the proper divisors of the preceding number. For example, 1264460 ↦ 1547860 ↦ 1727636 ↦ 1305184 ↦ 1264460 ↦ … {\displaystyle 1264460\mapsto 1547860\mapsto 1727636\mapsto 1305184\mapsto 1264460\mapsto \dots } are ...

  4. Quasiperfect number - Wikipedia

    en.wikipedia.org/wiki/Quasiperfect_number

    In mathematics, a quasiperfect number is a natural number n for ... there are 5 known such numbers: 3, 10, 136, 32896 and 2147516416. ... Betrothed numbers relate to ...

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

  6. Fortunate number - Wikipedia

    en.wikipedia.org/wiki/Fortunate_number

    For example, to find the seventh Fortunate number, one would first calculate the product of the first seven primes (2, 3, 5, 7, 11, 13 and 17), which is 510510. Adding 2 to that gives another even number, while adding 3 would give another multiple of 3. One would similarly rule out the integers up to 18.

  7. Erdős–Woods number - Wikipedia

    en.wikipedia.org/wiki/Erdős–Woods_number

    The Erdős–Woods numbers can be characterized in terms of certain partitions of the prime numbers.A number k is an Erdős–Woods number if and only if the prime numbers less than k can be partitioned into two subsets X and Y with the following property: for every pair of positive integers x and y with x + y = k, either x is divisible by a prime in X, or y is divisible by a prime in Y.

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

  9. Lucas number - Wikipedia

    en.wikipedia.org/wiki/Lucas_number

    The sequence also has a variety of relationships with the Fibonacci numbers, like the fact that adding any two Fibonacci numbers two terms apart in the Fibonacci sequence results in the Lucas number in between. [3] The first few Lucas numbers are 2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2207, 3571, 5778, 9349, ... .