enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Category:Magic squares - Wikipedia

    en.wikipedia.org/wiki/Category:Magic_squares

    Print/export Download as PDF; Printable version; In other projects ... Pages in category "Magic squares" The following 47 pages are in this category, out of 47 total.

  3. File:Magic Squares - 8x8 - Permutations along 4x4 diagonals ...

    en.wikipedia.org/wiki/File:Magic_Squares_-_8x8...

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more

  4. File:4x4 magic square hierarchy.svg - Wikipedia

    en.wikipedia.org/wiki/File:4x4_magic_square...

    For each square, cells with the same colour (excluding grey) sum to the magic constant. Note *: The second requirement of most-perfect magic squares imply that any 2 cells that are 2 cells diagonally apart (including wraparound) sum to half the magic constant, hence any 2 such pairs also sum to the magic constant. Width: 100%: Height: 100%

  5. Magic square - Wikipedia

    en.wikipedia.org/wiki/Magic_square

    Bordered magic square when it is a magic square and it remains magic when the rows and columns on the outer edge are removed. They are also called concentric bordered magic squares if removing a border of a square successively gives another smaller bordered magic square. Bordered magic square do not exist for order 4.

  6. Frénicle standard form - Wikipedia

    en.wikipedia.org/wiki/Frénicle_standard_form

    A magic square is in the Frénicle standard form, named for Bernard Frénicle de Bessy, if the following two conditions hold: . the element at position [1,1] (top left corner) is the smallest of the four corner elements; and

  7. Conway's LUX method for magic squares - Wikipedia

    en.wikipedia.org/wiki/Conway's_LUX_method_for...

    Print/export Download as PDF; Printable version ... Conway's LUX method for magic squares is an algorithm by John Horton Conway for creating magic squares of order 4n ...

  8. Most-perfect magic square - Wikipedia

    en.wikipedia.org/wiki/Most-perfect_magic_square

    In their book, Kathleen Ollerenshaw and David S. Brée give a method of construction and enumeration of all most-perfect magic squares. They also show that there is a one-to-one correspondence between reversible squares and most-perfect magic squares. For n = 36, there are about 2.7 × 10 44 essentially different most-perfect magic squares.

  9. Siamese method - Wikipedia

    en.wikipedia.org/wiki/Siamese_method

    The Siamese method, or De la Loubère method, is a simple method to construct any size of n-odd magic squares (i.e. number squares in which the sums of all rows, columns and diagonals are identical). The method was brought to France in 1688 by the French mathematician and diplomat Simon de la Loubère , [ 1 ] as he was returning from his 1687 ...