Four different types of problems from graph theory are presented and discussed. (MK)

Possible ways of mechanization for counting using a binary system are discussed. Shows a binary representation of the numbers and geometric models having eight triples of lamps. Provides three problem sets. (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)

Discusses the difference between a generic chemistry problem (one which can be solved using an algorithm) and a harder chemistry problem (one for which there is no algorithm). Encourages teachers to help students recognize these categories of problems so they will be better able to find solutions. (TW)

Differentiates between problems, exercises and algorithms. Discusses the role of algorithms in solving problems and exercises in chemistry. Suggests that very real differences exist between solving problems and exercises, and that problem solving steps can be and should be taught in chemistry education. (TW)

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)