A. W. Faber Model 366
The A. W. Faber Model 366 was an unusual model of slide rule, manufactured in Germany by the A. W. Faber Company around 1909, with scales that followed a system invented by Johannes Schumacher (1858-1
Karatsuba algorithm
The Karatsuba algorithm is a fast multiplication algorithm. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It is a divide-and-conquer algorithm that reduces the multiplication o
Multiplication sign
The multiplication sign, also known as the times sign or the dimension sign, is the symbol ×, used in mathematics to denote the multiplication operation and its resulting product. While similar to a l
FOIL method
In secondary school, FOIL is a mnemonic for the standard method of multiplying two binomials—hence the method may be referred to as the FOIL method. The word FOIL is an acronym for the four terms of t
Empty product
In mathematics, an empty product, or nullary product or vacuous product, is the result of multiplying no factors. It is by convention equal to the multiplicative identity (assuming there is an identit
Promptuary
The promptuary, also known as the card abacus is a calculating machine invented by the 16th-century Scottish mathematician John Napier and described in his book Rabdologiae in which he also described
Infinite product
In mathematics, for a sequence of complex numbers a1, a2, a3, ... the infinite product is defined to be the limit of the partial products a1a2...an as n increases without bound. The product is said to
Product (mathematics)
In mathematics, a product is the result of multiplication, or an expression that identifies objects (numbers or variables) to be multiplied, called factors. For example, 30 is the product of 6 and 5 (
Dadda multiplier
The Dadda multiplier is a hardware binary multiplier design invented by computer scientist Luigi Dadda in 1965. It uses a selection of full and half adders to sum the partial products in stages (the D
Frobenius inner product
In mathematics, the Frobenius inner product is a binary operation that takes two matrices and returns a scalar. It is often denoted . The operation is a component-wise inner product of two matrices as
Genaille–Lucas rulers
Genaille–Lucas rulers (also known as Genaille's rods) are an arithmetic tool invented by , a French railway engineer, in 1891. The device is a variant of Napier's bones. By representing the carry grap
Multiplicative group of integers modulo n
In modular arithmetic, the integers coprime (relatively prime) to n from the set of n non-negative integers form a group under multiplication modulo n, called the multiplicative group of integers modu
Irish logarithm
Irish logarithms were a system of number manipulation invented by Percy Ludgate for machine multiplication. The system used a combination of mechanical cams as look-up tables and mechanical addition t
Parallel (operator)
The parallel operator (also known as reduced sum, parallel sum or parallel addition) (pronounced "parallel", following the parallel lines notation from geometry) is a mathematical function which is us
Ancient Egyptian multiplication
In mathematics, ancient Egyptian multiplication (also known as Egyptian multiplication, Ethiopian multiplication, Russian multiplication, or peasant multiplication), one of two multiplication methods
Grid method multiplication
The grid method (also known as the box method) of multiplication is an introductory approach to multi-digit multiplication calculations that involve numbers larger than ten. Because it is often taught
Carry-less product
The carry-less product of two binary numbersis the result of carry-less multiplication of these numbers.This operation conceptually works like long multiplicationexcept for the fact that the carryis d
Multiplication
Multiplication (often denoted by the cross symbol ×, by the mid-line ⋅, by juxtaposition, or, on computers, by an asterisk *) is one of the four elementary mathematical operations of arithmetic, with
Multiple (mathematics)
In mathematics, a multiple is the product of any quantity and an integer. In other words, for the quantities a and b, it can be said that b is a multiple of a if b = na for some integer n, which is ca
Scalar multiplication
In mathematics, scalar multiplication is one of the basic operations defining a vector space in linear algebra (or more generally, a module in abstract algebra). In common geometrical contexts, scalar
Toom–Cook multiplication
Toom–Cook, sometimes known as Toom-3, named after Andrei Toom, who introduced the new algorithm with its low complexity, and Stephen Cook, who cleaned the description of it, is a multiplication algori
Vector multiplication
In mathematics, vector multiplication may refer to one of several operations between two (or more) vectors. It may concern any of the following articles:
* Dot product – also known as the "scalar pro
Skip counting
Skip counting is a mathematics technique taught as a kind of multiplication in reform mathematics textbooks such as TERC. In older textbooks, this technique is called counting by twos (threes, fours,
Tsinghua Bamboo Slips
The Tsinghua Bamboo Strips (simplified Chinese: 清华简; traditional Chinese: 清華簡; pinyin: Qīnghuá jiǎn) are a collection of Chinese texts dating to the Warring States period and written in ink on strips
Slonimski's Theorem
Slonimski's Theorem is an observation by Hayyim Selig Slonimski that the sequence of carry digits in a multiplication table is the Farey sequence. This observation allowed Slonimski to create very com
Multiplication algorithm
A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are used. Efficient multiplication algorithms have existed si
Lattice multiplication
Lattice multiplication, also known as the Italian method, Chinese method, Chinese lattice, gelosia multiplication, sieve multiplication, shabakh, diagonally or Venetian squares, is a method of multipl
Schönhage–Strassen algorithm
The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. The run-time bit complexity is
Wallace tree
A Wallace multiplier is a hardware implementation of a binary multiplier, a digital circuit that multiplies two integers. It uses a selection of full and half adders (the Wallace tree or Wallace reduc
Lunar arithmetic
Lunar arithmetic, formerly called dismal arithmetic, is a version of arithmetic in which the addition and multiplication operations on digits are defined as the max and min operations. Thus, in lunar
Booth's multiplication algorithm
Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. The algorithm was invented by Andrew Donald Booth in 1950 while d
Multiplication table
In mathematics, a multiplication table (sometimes, less formally, a times table) is a mathematical table used to define a multiplication operation for an algebraic system. The decimal multiplication t
Matrix multiplication
In mathematics, particularly in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication, the number of columns in the first matr
Napier's bones
Napier's bones is a manually-operated calculating device created by John Napier of Merchiston, Scotland for the calculation of products and quotients of numbers. The method was based on lattice multip
Product integral
A product integral is any product-based counterpart of the usual sum-based integral of calculus. The first product integral ( below) was developed by the mathematician Vito Volterra in 1887 to solve s
Binary multiplier
A binary multiplier is an electronic circuit used in digital electronics, such as a computer, to multiply two binary numbers. A variety of computer arithmetic techniques can be used to implement a dig
Multiplicative inverse
In mathematics, a multiplicative inverse or reciprocal for a number x, denoted by 1/x or x−1, is a number which when multiplied by x yields the multiplicative identity, 1. The multiplicative inverse o