On multiplication theorems for magic squares

In this paper, we present, prove, and illustrate a Composition Theorem for Magic Squares.Let M and N be magic squares of orders p and q, respectively. For k = 1,2..., q2, letMk = M + (k - 1) p2 Jpwhere Jp = p x p matrix of all 1's. Form the array Nm of order pq obtained by replacing each entry...

Full description

Saved in:
Bibliographic Details
Main Authors: Antonio, Rosemarie M., Caleon, Heidee D.J.
Format: text
Language:English
Published: Animo Repository 1995
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_bachelors/16240
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
Description
Summary:In this paper, we present, prove, and illustrate a Composition Theorem for Magic Squares.Let M and N be magic squares of orders p and q, respectively. For k = 1,2..., q2, letMk = M + (k - 1) p2 Jpwhere Jp = p x p matrix of all 1's. Form the array Nm of order pq obtained by replacing each entry of N by Mk. Then Nm is a magic square of order pq.Using this composition theorem, we can compose the approximate magic square N = 14 32 with anu p x p matrix M to form a magic square of order 2p.