enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Polite number - Wikipedia

    en.wikipedia.org/wiki/Polite_number

    A Young diagram representing visually a polite expansion 15 = 4 + 5 + 6. In number theory, a polite number is a positive integer that can be written as the sum of two or more consecutive positive integers. A positive integer which is not polite is called impolite.

  3. Sums of powers - Wikipedia

    en.wikipedia.org/wiki/Sums_of_powers

    The ErdÅ‘s–Moser equation, + + + = (+) where m and k are positive integers, is conjectured to have no solutions other than 1 1 + 2 1 = 3 1. The sums of three cubes cannot equal 4 or 5 modulo 9, but it is unknown whether all remaining integers can be expressed in this form.

  4. List of integer sequences - Wikipedia

    en.wikipedia.org/wiki/List_of_integer_sequences

    Name First elements Short description OEIS Mersenne prime exponents : 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, ... Primes p such that 2 p − 1 is prime.: A000043 ...

  5. Sums of three cubes - Wikipedia

    en.wikipedia.org/wiki/Sums_of_three_cubes

    Euler's sum of powers conjecture § k = 3, relating to cubes that can be written as a sum of three positive cubes; Plato's number, an ancient text possibly discussing the equation 3 3 + 4 3 + 5 3 = 6 3; Taxicab number, the smallest integer that can be expressed as a sum of two positive integer cubes in n distinct ways

  6. Integer partition - Wikipedia

    en.wikipedia.org/wiki/Integer_partition

    3 + 1 2 + 2 2 + 1 + 1 1 + 1 + 1 + 1. The only partition of zero is the empty sum, having no parts. The order-dependent composition 1 + 3 is the same partition as 3 + 1, and the two distinct compositions 1 + 2 + 1 and 1 + 1 + 2 represent the same partition as 2 + 1 + 1. An individual summand in a partition is called a part.

  7. Composition (combinatorics) - Wikipedia

    en.wikipedia.org/wiki/Composition_(combinatorics)

    Each positive integer n has 2 n−1 distinct compositions. Bijection between 3 bit binary numbers and compositions of 4 A weak composition of an integer n is similar to a composition of n , but allowing terms of the sequence to be zero: it is a way of writing n as the sum of a sequence of non-negative integers .

  8. Partition function (number theory) - Wikipedia

    en.wikipedia.org/wiki/Partition_function_(number...

    For a positive integer n, p(n) is the number of distinct ways of representing n as a sum of positive integers. For the purposes of this definition, the order of the terms in the sum is irrelevant: two sums with the same terms in a different order are not considered to be distinct.

  9. Pythagorean triple - Wikipedia

    en.wikipedia.org/wiki/Pythagorean_triple

    Animation demonstrating the smallest Pythagorean triple, 3 2 + 4 2 = 5 2. A Pythagorean triple consists of three positive integers a, b, and c, such that a 2 + b 2 = c 2. Such a triple is commonly written (a, b, c), a well-known example is (3, 4, 5). If (a, b, c) is a Pythagorean triple, then so is (ka, kb, kc) for any positive integer k.