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)

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)

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)

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)

Computing pi efficiently has been of great interest to mathematicians for centuries. This article presents an algorithm to solve this problem through skillful computer use. (PK)