enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Pronic_number

    A pronic number is a number that is the product of two consecutive integers, that is, a number of the form (+). [1] The study of these numbers dates back to Aristotle.They are also called oblong numbers, heteromecic numbers, [2] or rectangular numbers; [3] however, the term "rectangular number" has also been applied to the composite numbers.

  3. Formulas for generating Pythagorean triples - Wikipedia

    en.wikipedia.org/wiki/Formulas_for_generating...

    Leonardo of Pisa (c. 1170 – c. 1250) described this method [1] [2] for generating primitive triples using the sequence of consecutive odd integers ,,,,, … and the fact that the sum of the first n terms of this sequence is .

  4. Composite number - Wikipedia

    en.wikipedia.org/wiki/Composite_number

    A composite number is a positive integer that can be formed by multiplying two smaller positive integers. Accordingly it is a positive integer that has at least one divisor other than 1 and itself. [ 1 ] [ 2 ] Every positive integer is composite, prime , or the unit 1, so the composite numbers are exactly the numbers that are not prime and not ...

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

  6. Pythagorean triple - Wikipedia

    en.wikipedia.org/wiki/Pythagorean_triple

    Gaussian integers are complex numbers of the form α = u + vi, where u and v are ordinary integers and i is the square root of negative one. The units of Gaussian integers are ±1 and ±i. The ordinary integers are called the rational integers and denoted as ' Z '. The Gaussian integers are denoted as Z[i].

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

  8. Sum of squares - Wikipedia

    en.wikipedia.org/wiki/Sum_of_squares

    Pythagorean triples are sets of three integers such that the sum of the squares of the first two equals the square of the third. A Pythagorean prime is a prime that is the sum of two squares; Fermat's theorem on sums of two squares states which primes are Pythagorean primes.

  9. List of integer sequences - Wikipedia

    en.wikipedia.org/wiki/List_of_integer_sequences

    The length of an interval of consecutive integers with property that every element has a factor in common with one of the endpoints. A059756: Sierpinski numbers: 78557, 271129, 271577, 322523, 327739, 482719, 575041, 603713, 903983, 934909, ... Odd k for which { k⋅2 n + 1 : n ∈ } consists only of composite numbers. A076336