Until recently the testing of a 100-digit number to determine whether it is prime or composite could have taken a century. However, in the past two years a method has been developed enabling a computer to determine the primality of an arbitrary number in about 40 seconds of running time. (Author/JN)

Describes a number sequence made by counting the occurrence of each digit from 9 to 0, catenating this count with the digit, and joining these numeric strings to form a new term. Presents a computer-aided proof and an analytic proof of the sequence; compares these two methods of proof. (YP)