enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Bernard Frénicle de Bessy - Wikipedia

    en.wikipedia.org/wiki/Bernard_Frénicle_de_Bessy

    Bernard Frénicle de Bessy (c. 1604 – 1674), was a French mathematician born in Paris, who wrote numerous mathematical papers, mainly in number theory and combinatorics.He is best remembered for Des quarrez ou tables magiques, a treatise on magic squares published posthumously in 1693, in which he described all 880 essentially different normal magic squares of order 4.

  3. Associative magic square - Wikipedia

    en.wikipedia.org/wiki/Associative_magic_square

    The number zero for n = 6 is an example of a more general phenomenon: associative magic squares do not exist for values of n that are singly even (equal to 2 modulo 4). [3] Every associative magic square of even order forms a singular matrix, but associative magic squares of odd order can be singular or nonsingular. [4]

  4. Magic series - Wikipedia

    en.wikipedia.org/wiki/Magic_series

    A magic series is a set of distinct positive integers which add up to the magic constant of a magic square and a magic cube, thus potentially making up lines in magic tesseracts. So, in an n × n magic square using the numbers from 1 to n 2, a magic series is a set of n distinct numbers adding up to n(n 2 + 1)/2.

  5. Magic constant - Wikipedia

    en.wikipedia.org/wiki/Magic_constant

    The magic constant or magic sum of a magic square is the sum of numbers in any row, column, or diagonal of the magic square. For example, the magic square shown below has a magic constant of 15. For a normal magic square of order n – that is, a magic square which contains the numbers 1, 2, ..., n 2 – the magic constant is = +.

  6. Most-perfect magic square - Wikipedia

    en.wikipedia.org/wiki/Most-perfect_magic_square

    A most-perfect magic square of order n is a magic square containing the numbers 1 to n 2 with two additional properties: Each 2 × 2 subsquare sums to 2 s , where s = n 2 + 1. All pairs of integers distant n /2 along a (major) diagonal sum to s .

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

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

  9. List of recreational number theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_recreational...

    This is a list of recreational number theory topics (see number theory, recreational mathematics). Listing here is not pejorative : many famous topics in number theory have origins in challenging problems posed purely for their own sake.