Paper ribbons and the greatest common divisor

A fictional ribbon problem

Imagine two paper ribbons represented by lengths of 252 and 180 equal units. These are invented whole numbers, not measurements from a school, craft business or local program.

We want the longest whole-unit piece that can divide both ribbons without leaving anything over. A piece of length one works, but that answer ignores the request for the longest possible piece.

A piece of length 36 also works: seven pieces cover 252, and five cover 180. The exercise is to establish that 36 is the greatest answer, not merely to notice that it is an answer.

Keep the original question visible while working. Both ribbons must be divided into pieces of the same length, every piece must be a positive whole number of units, and there can be no remainder.

Allowing different piece lengths for the two ribbons would create another problem. Allowing a leftover strip would also change it.

The small model gives us a way to separate a verified answer from a plausible-looking one without making claims about actual cutting accuracy, waste, materials or classroom performance.

Replace a large question with a smaller one

Subtract 180 from 252. The remainder is 72, so write 252 = 1 × 180 + 72.

Suppose an unknown whole number divides both original lengths. It must divide their difference, because removing a whole number of its pieces from another whole number of its pieces leaves whole pieces.

Every common divisor of 252 and 180 therefore also divides 72. Instead of testing all possible piece lengths against 252 and 180, we may investigate the smaller pair, 180 and 72.

The reasoning also runs backward. If a number divides both 180 and 72, it divides their sum, 252.

Thus the two pairs have exactly the same common divisors, not just one answer that happens to match. This two-way statement is the important part of the argument.

A procedure that preserved only some possible answers might discard the greatest one. Here, subtraction preserves the entire set we care about, which is why replacing the pair is legitimate.

Follow the remainders to a stopping point

Now divide 180 by 72. Two groups of 72 use 144, leaving 36, so 180 = 2 × 72 + 36.

The same argument replaces the pair 180 and 72 with 72 and 36. Finally, 72 = 2 × 36 + 0.

A zero remainder is a stopping signal: 36 divides 72 exactly. Do not report zero as the piece length.

Zero is the amount left over in this final division, not a positive length capable of covering either ribbon.

The last nonzero remainder is 36. At the final pair, every common divisor must divide 36, so none can be greater than 36.

Meanwhile 36 itself divides both members of that pair. Because each earlier replacement preserved exactly the same common divisors, 36 is also the greatest common divisor of the original pair.

This explains the answer without relying on a guess, a memorized list of factors or an unexplained instruction to take the last number written.

Check the answer against the untouched inputs

Return to 252 and 180 rather than checking only the reduced pair. Dividing 252 by 36 gives seven, and dividing 180 by 36 gives five.

Those integer counts establish that our proposed length works for both original ribbons. The earlier preservation argument establishes that no larger common divisor was lost.

These are complementary checks: a working candidate is not automatically the greatest candidate, while a correct argument about smaller numbers still needs to stay attached to the original inputs.

An alternative candidate of 18 would produce fourteen pieces and ten pieces. It works, but it is not greatest because 36 is larger and also works.

A candidate of 42 divides 252 into six equal pieces but leaves 12 after four pieces cover 168 of the second ribbon. Being a factor of just one input is insufficient.

Naming these particular failures is more informative than telling a partner that their answer simply looks wrong.

Why repeated reduction finishes

After each nonfinal division, the new remainder is at least zero and smaller than the divisor just used. Our positive remainder sequence is 72, then 36; the next remainder is zero.

Positive whole numbers cannot keep getting strictly smaller forever. That supplies a termination argument for positive whole-number inputs.

It does not promise a specific running time on a computer, nor does the number of paper lines measure how quickly a learner understands the method.

Try another invented pair, 35 and 22. The divisions are 35 = 1 × 22 + 13, 22 = 1 × 13 + 9, 13 = 1 × 9 + 4, 9 = 2 × 4 + 1, and 4 = 4 × 1 + 0.

The greatest common divisor is one. This pair shares no positive whole-unit piece length larger than one, even though both individual numbers have factors larger than one.

The conclusion concerns a shared divisor, not whether each number is prime.

Explore boundaries without silently changing the rule

Equal inputs provide a useful boundary check. For ribbons of 24 and 24 units, one division gives 24 = 1 × 24 + 0.

The answer is 24, and each ribbon needs one piece. If the smaller input divides the larger immediately, the first remainder is already zero; there is no reason to invent an extra subtraction stage.

Our ribbon story assumes both lengths are positive, so it does not use a zero-length ribbon to define a physical cutting task.

For a final paper challenge, use 84 and 30. Write 84 = 2 × 30 + 24, 30 = 1 × 24 + 6, and 24 = 4 × 6 + 0.

Check six against the originals: fourteen pieces and five pieces cover them exactly. Then explain why three also works but cannot be the greatest answer.

A partner can reproduce every arithmetic step and the two-way preservation argument. That reproducibility, rather than a claim about a real workshop or measured benefit, is the purpose of this original exercise.

Inspect the reasoning and its limits

Gretna Junction created this exercise and its companion proof record on October 18, 2026. The record preserves the division method, the worked examples and results for every pair of positive whole numbers from one through 120, totaling 14,400 pairs.

A separate checker compares each result with a direct search for common divisors. Those finite checks can expose arithmetic mistakes within that range; they do not test every possible input.

The two-way divisor argument and decreasing-remainder argument explain the general positive-integer result. No elapsed-time measurement, software recovery test or actual ribbon-cutting trial is reported.