enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Polite_number

    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. [1] [2] The impolite numbers are exactly the powers of two, and the polite numbers are the natural numbers that are not powers of two.

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

  4. Integer partition - Wikipedia

    en.wikipedia.org/wiki/Integer_partition

    In number theory and combinatorics, a partition of a non-negative integer n, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. (If order matters, the sum becomes a composition.)

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

  6. 1 + 2 + 3 + 4 + ⋯ - ⋯ - Wikipedia

    en.wikipedia.org/wiki/1_%2B_2_%2B_3_%2B_4_%2B_%E...

    One can then prove that this smoothed sum is asymptotic to ⁠− + 1 / 12 ⁠ + CN 2, where C is a constant that depends on f. The constant term of the asymptotic expansion does not depend on f : it is necessarily the same value given by analytic continuation, ⁠− + 1 / 12 ⁠ .

  7. Waring's problem - Wikipedia

    en.wikipedia.org/wiki/Waring's_problem

    In number theory, Waring's problem asks whether each natural number k has an associated positive integer s such that every natural number is the sum of at most s natural numbers raised to the power k. For example, every natural number is the sum of at most 4 squares, 9 cubes, or 19 fourth powers.

  8. Sums of powers - Wikipedia

    en.wikipedia.org/wiki/Sums_of_powers

    In mathematics and statistics, sums of powers occur in a number of contexts: . Sums of squares arise in many contexts. For example, in geometry, the Pythagorean theorem involves the sum of two squares; in number theory, there are Legendre's three-square theorem and Jacobi's four-square theorem; and in statistics, the analysis of variance involves summing the squares of quantities.

  9. Arithmetic progression - Wikipedia

    en.wikipedia.org/wiki/Arithmetic_progression

    For instance, the sequence 5, 7, 9, 11, 13, 15, . . . is an arithmetic progression with a common difference of 2. If the initial term of an arithmetic progression is a 1 {\displaystyle a_{1}} and the common difference of successive members is d {\displaystyle d} , then the n {\displaystyle n} -th term of the sequence ( a n {\displaystyle a_{n ...