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)

Discusses a calculation method to approximate pi. Describes how to get an approximation to the circumscribed and inscribed perimeters of regular polygons of n sides. Presents the computer program and result of the approximation. (YP)

The purpose of this paper is to show, by computer examples, that very different results can be obtained by rearranging selected conditionally convergent series. Computer programs allow the students to select the real number to which they wish the rearrangement to converge. Two computer programs are appended. (KR)