Numbers become state

What must a representation make possible before arithmetic becomes a reusable algorithm?

Zero and signed quantities enlarged the states arithmetic could represent. Systematic algebra then turned whole classes of verbal problems into repeatable transformations rather than isolated tricks.

A better representation creates new valid states; an algorithm creates a reliable path between those states.

Reconstruct the mechanism

1. Extend notation with zero and signed quantities
2. Define operations and edge cases over the enlarged state
3. Express a problem class through symbolic relationships
4. Apply a finite procedure that preserves equality to reach a solution

Implement signed arithmetic, deliberately test division by zero, then translate one rhetorical quadratic procedure into pseudocode.

Evidence and uncertainty

Extending a formal system also creates dangerous edges: some early zero rules were powerful while division-by-zero claims were not valid.

• Brahmagupta — MacTutor · University of St Andrews
• Al-Khwārizmī — MacTutor · University of St Andrews