The Euclidean algorithm for finding the greatest common divisor is presented. (MNS)

A student noticed an interesting fact about the base two numerals for perfect numbers. Mathematical explanations for some questions are given. (MNS)

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)

Presents a methodology designed to strengthen the cognitive effects of using graphing calculators to solve polynomial equations using pattern matching, searching, and heuristics. Discusses pattern matching as a problem-solving strategy useful in the physical, social, political, and economic worlds of today's students. (DDR)

Illustrates where several unexpected patterns of antiderivatives can be realized during calculus instruction via the application of integration by parts to the exploration of particular members of families of functions. (JJK)