Discusses a numerical technique called the method of adjoints, turning a linear two-point boundary value problem into an initial value problem. Described are steps for using the method in linear or nonlinear systems. Applies the technique to solve a simple pendulum problem. Lists 15 references. (YP)

This report illustrates a simple, short, yet relatively little known partial check on addition that elementary school pupils can be lead to discover, and later taught to understand. The process can also be used for subtraction and is viewed as more useful than the traditional check of casting out nines. (MP)

Possible ways of mechanization for counting using a binary system are discussed. Shows a binary representation of the numbers and geometric models having eight triples of lamps. Provides three problem sets. (YP)

Describes a pattern which emerged from an examination of the digits of the squares of numbers. Provides eight examples having the pattern at the units or tens digit of the number. (YP)

Outlines various subtraction methods, such as the decomposition method, equal-addends method, and low-stress algorithm. Describes a subtraction method by addition of complements. Discusses the advantages and disadvantages of the method. (YP)

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)

Describes examples of rational representation as a guide for translating terminology and information encountered in manuals for computers. Discusses four limitations of the representation. (YP)

Describes the algorithm used to select a simple random sample of certain size without having to list all possible samples and a justification based on Pascal's triangle. Provides testing results by various computers. (YP)

Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)

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)

Discusses how to express an n factorial as a product of powers of primes. Provides two examples and answers. Presents four related suggestions. (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)

Discussed are three examples of computer graphics including biomorphs, Truchet tilings, and fractal popcorn. The graphics are shown and the basic algorithm using multiple iteration of a particular function or mathematical operation is described. An illustration of a snail shell created by computer graphics is presented. (YP)

The rule of 78 is used by banks and loan companies to compute the amounts due when installment loans are paid early. Describes an unexpected case of negative amortization when the rule is applied. Presents an actual problem and discusses the case. (YP)

Describes an algorithm that provides more rapid convergence for more complicated forms of phase separation requiring the use of a digital computer. Demonstrates that this "inside-out" algorithm remains efficient for determination of the equilibrium states for any type of phase transition for a binary system. (CW)