Lattice multiplication

Lattice multiplication, also known as the Italian method, Chinese method, Chinese lattice, gelosia multiplication,^[1] sieve multiplication, shabakh, diagonally or Venetian squares, is a method of multiplication that uses a lattice to multiply two multi-digit numbers. It is mathematically identical to the more commonly used long multiplication algorithm, but it breaks the process into smaller steps, which some practitioners find easier to use.^[2]

The method had already arisen by medieval times, and has been used for centuries in many different cultures. It is still being taught in certain curricula today.^[3]^[4]

^ Williams, Michael R. (1997). A history of computing technology (2nd ed.). Los Alamitos, Calif.: IEEE Computer Society Press. ISBN 0-8186-7739-2. OCLC 35723637.
^ Cite error: The named reference Lattice multiplication was invoked but never defined (see the help page).
^ Boag, Elizabeth (November 2007). ""Lattice Multiplication"". BSHM Bulletin: Journal of the British Society for the History of Mathematics. 22 (3): 182–184. doi:10.1080/14794800008520169. S2CID 122212455. Retrieved 25 February 2022.
^ Nugent, Patricia (2007). ""Lattice Multiplication in a Preservice Classroom"". National Council of Teachers of Mathematics. 13 (2): 110–113. doi:10.5951/MTMS.13.2.0110. Retrieved 25 February 2022.

[1] Williams, Michael R. (1997). A history of computing technology (2nd ed.). Los Alamitos, Calif.: IEEE Computer Society Press. ISBN 0-8186-7739-2. OCLC 35723637.

[Lattice_multiplication-2] Cite error: The named reference Lattice multiplication was invoked but never defined (see the help page).

[3] Boag, Elizabeth (November 2007). ""Lattice Multiplication"". BSHM Bulletin: Journal of the British Society for the History of Mathematics. 22 (3): 182–184. doi:10.1080/14794800008520169. S2CID 122212455. Retrieved 25 February 2022.

[4] Nugent, Patricia (2007). ""Lattice Multiplication in a Preservice Classroom"". National Council of Teachers of Mathematics. 13 (2): 110–113. doi:10.5951/MTMS.13.2.0110. Retrieved 25 February 2022.

[1]

[2]

[3]

[4]