Magic rectangles revisited (Q1817566)

From MaRDI portal
Revision as of 10:26, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Magic rectangles revisited
scientific article

    Statements

    Magic rectangles revisited (English)
    0 references
    0 references
    15 August 2000
    0 references
    An \(m \times n\) magic rectangle is an \(m \times n\) array of the integers \(1, 2, \ldots, mn\) so that the sum of the entries is constant in each row (\( \frac n{mn+1,2}\)) and in each column (\(\frac m{mn+1,2}\)). The necessary conditions (\(m, n >1\), \((m,n) \neq (2,2)\) and \(m\) and \(n\) of the same parity) have long been known to be sufficient. The author provides a simple proof.
    0 references
    magic square
    0 references
    magic rectangle
    0 references

    Identifiers