B Combinatorics and Magic squares

NEW4M
Messages
4
Reaction score
0
TL;DR Summary
Magic squares. How to fill a magic square of order n in a symmetrical and logical way by analyzing the possible ways to achieve a given sum of numbers.
I have questions about how to count number of ways to fill a magic square of order n.
Hi there. Happy new year.
I am interested in magic squares. I am particularly interested in how to fill a square of order n in a symmetrical and logical way by analyzing the possible ways to achieve a given sum of numbers.
My question is about combinatorics analyses.
For example for a square of order n=4, the sum of rows, columns and diagonals must be equal to S=n *(n²+1)/2 =34.
There are C4,16 = 1,820 combinations of 4 different numbers between 1 and 16. Only 86 of these combinations are equal to 34, among those possible. And among these 86 combinations, there are several ways to assemble them to form such a magic square of order 4 which require a total of 10 different combined sums (4 rows + 4 columns + 2 diagonals).
My questions are:
a) How to compute this number of combinations whose sum makes 34 (equal to 86 possibilities in the quoted case) knowing that i) we have to consider all combinations of 4 different digits taken among n=1 to n=16, that is to say 1,820 (apply also the remark point iii); ii) in a sum, one must have only different digits used once; iii) all permutations of a sequence are counted only once (so for example, the permuted sums 1+3+14+16 = 3+14+1+16=14+3+16+1=. ...etc...=34 are counted only once; d) the possible sums range from the smallest 1+2+3+4 = 10 to the largest 13+14+15+16=58; e) the sum we are interested in are that equal to S=n *(n²+1)/2 =34. It is thus a question of counting under these conditions, how many of these combinations among 1820 make a sum S=34. What are the combinatorics equations ?
b) How many possibilities are there to form such a magic square except for rotation or mirror symmetries?
How to establish these different combinatorics computations?
The combinatoric analysis, taking into account multiple partitions without permutation, does not seem simple to determine at first sight.
Thank you very much.
New4M.
 
Mathematics news on Phys.org
If I read this Wikipedia link correctly, the question you are asking is an unsolved problem in mathematics.
 
Thank you so much for the link.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top