Criteria For Divisibility (Popular Lectures in Mathematics) | N. N. Vorob’ev

N. N. Vorob'ev’s Criteria for Divisibility introduces the high school or early college student to a specific number-theoretic topic and explains the general mathematical structures which underlie the particular concepts discussed. Vorob’ev discusses the ideas of well-ordered sets, partial and linear orderings, equivalence relations, equiva­ lence classes, algorithms, and the relationship between the determinability of algorithms defined on the integers and the well-ordering principle.