On multiplication theorems for magic squares
Date of Publication
1995
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/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.
Abstract Format
html
Language
English
Format
Accession Number
TU07040
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
55 leaves
Keywords
Magic squares; Mathematical recreations; Matrices; Number theory
Recommended Citation
Antonio, R. M., & Caleon, H. D. (1995). On multiplication theorems for magic squares. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16240