Skip to main content
Log in

Counting forumula for 3 × 3 generalized magic squares

  • Classroom
  • Published:
Resonance Aims and scope Submit manuscript

Abstract

The aim of this article is to explicitly compute the number of generalized magic squares of order 3. Counting functions for (generalized) magic squares of order n with fixed line sum r is known to be a polynomial function in r over ℚ of degree (n−1)2. For higher values of n, it is quite difficult to explicitly write down such counting functions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Suggested Reading

  1. P A MacMohan, Combinatory Analysis, Chelsea, New York, 1960.

    Google Scholar 

  2. E Ehrhart, Sur les carres magiques, C. R Acad. Sci Paris Ser., Vol.A27, pp.575–577, 1973.

    Google Scholar 

  3. R P Stanley, Linear homogeneous Diophantine equations and Magic labeling of graphs, Duke Math. J., Vol.40, pp.607–632, 1973.

    Article  Google Scholar 

  4. H Anand, V C Dumir, and H Gupta, A combinatorial distribution problem, Duke Math. J. Vol.33, pp.757–769, 1966.

    Article  Google Scholar 

  5. R P Stanley, Linear Diophantine equations and local cohomology, Inv. Math., Vol.68, pp.175–193, 1982.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chanchal Kumar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kumar, C., Singh, P. & Kumar, A. Counting forumula for 3 × 3 generalized magic squares. Reson 15, 733–736 (2010). https://doi.org/10.1007/s12045-010-0082-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12045-010-0082-9

Keywords

Navigation