Computer program for magic squares

Date of Publication

1993

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

This thesis aims to construct a computer program that generates a magic square of any order greater than 2 and less than 181. A magic square is a sqare array of n2 distinct positive integers such that the sum of n numbers lying in any horizontal, vertical, or main diagonal line is always the same. Magic squares can be divided into three types: odd-order magic squares where n - 2m + 1 singly-even magic squares where n = 2(2m + 1) and doubly-even magic squares where n = 2(2m), where n and more positive integers. There are several methods to construct magic squares but only three distinct methods are used in the computer program to construct each type of magic square.Any magic square may be subjected to transformations which affect one's manner of looking at the square. These transformations are generated by two basic operations - rotation through a right angle and reflection in a mirror. Starting from any one magic square, seven additional magic squares may be produced in this manner. Rotations and reflections will also be generated by the computer program.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU06109

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

Physical Description

58 leaves

Keywords

Computer programs; Programming (Mathematics); Magic squares; Mathematical recreations

This document is currently not available here.

Share

COinS