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

    Squares with side lengths 1/1807 or smaller are too small to see in the figure and are not shown. In number theory, Sylvester's sequence is an integer sequence in which each term is the product of the previous terms, plus one. Its first few terms are 2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 (sequence A000058 in ...

  3. Square number - Wikipedia

    en.wikipedia.org/wiki/Square_number

    Squares of even numbers are even, and are divisible by 4, since (2n) 2 = 4n 2. Squares of odd numbers are odd, and are congruent to 1 modulo 8, since (2n + 1) 2 = 4n(n + 1) + 1, and n(n + 1) is always even. In other words, all odd square numbers have a remainder of 1 when divided by 8. Every odd perfect square is a centered octagonal number ...

  4. Siamese method - Wikipedia

    en.wikipedia.org/wiki/Siamese_method

    For example the following sequence can be used to form an order 3 magic square according to the Siamese method (9 boxes): 5, 10, 15, 20, 25, 30, 35, 40, 45 (the magic sum gives 75, for all rows, columns and diagonals). The magic sum in these cases will be the sum of the arithmetic progression used divided by the order of the magic square.

  5. Magic square - Wikipedia

    en.wikipedia.org/wiki/Magic_square

    The smallest (and unique up to rotation and reflection) non-trivial case of a magic square, order 3. In mathematics, especially historical and recreational mathematics, a square array of numbers, usually positive integers, is called a magic square if the sums of the numbers in each row, each column, and both main diagonals are the same.

  6. On-Line Encyclopedia of Integer Sequences - Wikipedia

    en.wikipedia.org/wiki/On-Line_Encyclopedia_of...

    Sequence A073502, the magic constant for n × n magic square with prime entries (regarding 1 as a prime) with smallest row sums, is an example of a sequence with offset 3, and A072171, "Number of stars of visual magnitude n." is an example of a sequence with offset −1.

  7. Sum of two squares theorem - Wikipedia

    en.wikipedia.org/wiki/Sum_of_two_squares_theorem

    The numbers that can be represented as the sums of two squares form the integer sequence [2]. 0, 1, 2, 4, 5, 8, 9, 10, 13, 16, 17, 18, 20, 25, 26, 29, 32, ... They ...

  8. Sum of squares - Wikipedia

    en.wikipedia.org/wiki/Sum_of_squares

    The squared Euclidean distance between two points, equal to the sum of squares of the differences between their coordinates; Heron's formula for the area of a triangle can be re-written as using the sums of squares of a triangle's sides (and the sums of the squares of squares) The British flag theorem for rectangles equates two sums of two squares

  9. Multimagic square - Wikipedia

    en.wikipedia.org/wiki/Multimagic_square

    The first 4-magic square was constructed by Charles Devimeux in 1983 and was a 256-order square. A 4-magic square of order 512 was constructed in May 2001 by André Viricel and Christian Boyer. [1] The first 5-magic square, of order 1024 arrived about one month later, in June 2001 again by Viricel and Boyer. They also presented a smaller 4 ...