Rapheal Akwesi FoderStudent of Diabene SHTS,Ghana education service
General MathematicsHistory and OverviewNumber TheoryNumerical Analysis and Scientific ComputingData Analysismathscidoc:2611.13002
11, 2026.11
Thispreprintpresentsanaccumulationalgorithmfordistributivemultiplication. Themethod
originates from an observation made during a secondary-school mathematics lesson, in which
a student, while the teacher demonstrated conventional multiplication, applied a different
arrangement of partial products and arrived at identical results. The procedure multiplies
each digit of one factor by the entire other factor, combines adjacent partial products by ac-
cumulating the leading part of one into the running total of the preceding one, and appends
the final digit. Three variants are formalized: two-digit by one-digit, two-digit by two-digit,
and general m-digit by n-digit multiplication. For each variant, an explicit formula and
worked examples are provided. A formal theorem establishes exactness for all integers, and
a proof by induction is given. The method is shown to be algebraically equivalent to the
distributive law combined with Horner’s scheme with carry correction. Furthermore, the
algorithm is reversible, allowing the recovery of intermediate values and original factors
from the final product. The work is intended as a pedagogical exposition of an alterna-
tive organizational route to the same arithmetic result, not as a claim of a new arithmetic
identity.