An algorithm is presented as a systematic procedure for solving a problem. The chapter begins with addition and asks not only how to perform an operation, but also why the procedure works and how the amount of work changes with the size of the numbers. This turns a familiar calculation into an opportunity to think about efficiency and justification.
For addition, the chapter explains the role of place value. Digits are grouped into units, tens, hundreds and higher places. When a smaller place generates a group of ten, that group is carried to the next place. The algorithm therefore reflects the structure of the numbers rather than being a collection of arbitrary steps. The chapter also asks how the reasoning could be adapted to decimal fractions.
The greatest common divisor (GCD), or highest common factor, provides a second setting for algorithmic thinking. A direct method begins from the definition: list the divisors of each number, compare the two collections, and identify the largest common divisor. This is logically straightforward but may require considerable work for large numbers.
The chapter develops more efficient ways to compute the GCD, culminating in Euclid's remainder-based algorithm. The central idea is to replace a pair of numbers by a smaller pair while preserving their greatest common divisor. The emphasis is not only on obtaining an answer but on explaining why each step is valid and why the process becomes efficient. Thus, the chapter connects procedure, correctness, efficiency and mathematical reasoning.
The chapter compares different ways of carrying out the same mathematical task. A direct divisor-listing method for GCD follows naturally from the definition, but it can become costly as numbers grow. Euclid's subtraction algorithm reduces the problem to smaller numbers while preserving the set of common divisors. The improved remainder-based version makes a much larger reduction in each step, illustrating how changing one operation can greatly improve efficiency.
For example, the textbook works through gcd(375, 825) using repeated subtraction and reaches gcd(75, 0), giving 75. It then explains why the subtraction rule is valid: common divisors of the original pair are exactly the common divisors of the reduced pair. The remainder-based algorithm replaces repeated subtraction by division with remainder; the stopping condition remains the same, namely gcd(m, 0) = m.