Provides several algorithms that use extended precision methods to compute large factorials exactly. The programs are written in BASIC and PASCAL. The approach used for computing N considers how large N is, how the built-in limitation on exact integer representation can be bypassed, and how long it takes to compute N. (JN)

A program for drawing a line segment is developed. (MNS)

An efficient division algorithm is developed, using a computer program, to convert any positive fraction to its decimal representation. The computer program listing is included. (MNS)

Develops a general computer algorithm to obtain a magic square having a number of rows that is a multiple of four. Presents a BASIC program and sample runs. (YP)

This article develops an algorithm to find all solutions to the problem, making all sums of a hexagram's nine lines the same. It shows how to exploit the geometric structure of the hexagram and its group of automorphisms. (YP)

Shows a series of Euclidean equations using the Euclidean algorithm to get the greatest common divisor of two integers. Describes the use of the equations to generate a series of circles. Discusses computer generation of Euclidean circles and provides a BASIC program. (YP)

The author presents two examples of lattice multiplication followed by a computer algorithm to perform this multiplication. The algorithm is given in psuedocode but could easily be given in Pascal. (PK)

Presented are the mathematical explanation of the algorithm for representing rational numbers in base two, paper-and-pencil methods for producing the representation, some patterns in these representations, and pseudocode for computer programs to explore these patterns. (MNS)

Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)

Implements a table algorithm on a spreadsheet program and obtains functions for several number sequences such as the Fibonacci and Catalan numbers. Considers other applications of the table algorithm to integers represented in various number bases. (YP)