To determine how hard it is for computers to solve problems, researchers have classified groups of problems (polynomial hierarchy) according to how much time they seem to require for their solutions. A difficult and complex proof is offered which shows that a combinatorial approach (using Boolean circuits) may resolve the problem. (JN)

The history of formal mathematical proofs is sketched out, starting with the Greeks. Included in this document is a chronological guide to mathematics and the world, highlighting major events in the world and important mathematicians in corresponding times. (MP)

Presents an interview with Erno Rubik, creator of "Rubik's Cube." Included are comments about the creation of the cube and the role of the cube in educating people, especially in problem-solving activities. (JN)

Beginning geometry students misunderstand the requirements of formal proof because of confusion between deductive reasoning and argumentation. Presented is a cognitive analysis of deductive organization versus argumentative organization of reasoning and the applications of this analysis to learning. Implications of a study analyzing students'…