enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Sylvester's sequence - Wikipedia

    en.wikipedia.org/wiki/Sylvester's_sequence

    The sequence can be used to prove that there are infinitely many prime numbers, as any prime can divide at most one number in the sequence. More strongly, no prime factor of a number in the sequence can be congruent to 5 modulo 6, and the sequence can be used to prove that there are infinitely many primes congruent to 7 modulo 12. [20]

  3. Congruum - Wikipedia

    en.wikipedia.org/wiki/Congruum

    a congruum is defined to be any number that can form the difference between successive square numbers in an arithmetic progression of three squares. That is, if , , and (for integers , , and ) are three square numbers that are equally spaced apart from each other, then the spacing between them, =, is called a congruum.

  4. Dirichlet's theorem on arithmetic progressions - Wikipedia

    en.wikipedia.org/wiki/Dirichlet's_theorem_on...

    Sequences dn + a with odd d are often ignored because half the numbers are even and the other half is the same numbers as a sequence with 2d, if we start with n = 0. For example, 6n + 1 produces the same primes as 3n + 1, while 6n + 5 produces the same as 3n + 2 except for the only even prime 2. The following table lists several arithmetic ...

  5. Square pyramidal number - Wikipedia

    en.wikipedia.org/wiki/Square_pyramidal_number

    Formulas for summing consecutive squares to give a cubic polynomial, whose values are the square pyramidal numbers, are given by Archimedes, who used this sum as a lemma as part of a study of the volume of a cone, [2] and by Fibonacci, as part of a more general solution to the problem of finding formulas for sums of progressions of squares. [3]

  6. Squared triangular number - Wikipedia

    en.wikipedia.org/wiki/Squared_triangular_number

    A square whose side length is a triangular number can be partitioned into squares and half-squares whose areas add to cubes. From Gulley (2010).The n th coloured region shows n squares of dimension n by n (the rectangle is 1 evenly divided square), hence the area of the n th region is n times n × n.

  7. Sum of two squares theorem - Wikipedia

    en.wikipedia.org/wiki/Sum_of_two_squares_theorem

    In number theory, the sum of two squares theorem relates the prime decomposition of any integer n > 1 to whether it can be written as a sum of two squares, such that n = a 2 + b 2 for some integers a, b.

  8. Constant-recursive sequence - Wikipedia

    en.wikipedia.org/wiki/Constant-recursive_sequence

    A constant-recursive sequence is any sequence of integers, rational numbers, algebraic numbers, real numbers, or complex numbers,,,, … (written as () = as a shorthand) satisfying a formula of the form

  9. Difference of two squares - Wikipedia

    en.wikipedia.org/wiki/Difference_of_two_squares

    The formula for the difference of two squares can be used for factoring polynomials that contain the square of a first quantity minus the square of a second quantity. For example, the polynomial x 4 − 1 {\displaystyle x^{4}-1} can be factored as follows: