Presents an example from the combinatorial theory of partially ordered sets. Discusses algorithms of on-line antichain partitioning problems, a topic in discrete optimization. (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)

P-adic or g-adic sets are sets of elements formed by linear combinations of powers of p, a prime number, or g, a counting number, where the coefficients are whole numbers less than p or g. Discusses exercises illustrating basic numerical operations for p-adic and g-adic sets. Provides BASIC computer programs to verify the solutions. (MDH)