Booth's multiplication algorithm
0 sources
Booth's multiplication algorithm
Summary
Booth's multiplication algorithm is a multiplication algorithm[1]. It draws 147 Wikipedia views per month (multiplication_algorithm category, ranking #3 of 10).[2]
Key Facts
- Booth's multiplication algorithm is credited with the discovery of Andrew Donald Booth[3].
- Booth's multiplication algorithm's instance of is recorded as multiplication algorithm[4].
- Andrew Donald Booth is named after Booth's multiplication algorithm[5].
- Booth's multiplication algorithm's Freebase ID is recorded as /m/05h15d[6].
- Booth's multiplication algorithm's defining formula is recorded as M \times \,^{\prime\prime} 0 \; 0 \; 1 \; 1 \; 1 \; 1 \; 1 \; 0 \,^{\prime\prime} = M \times (2^5 + 2^4 + 2^3 + 2^2 + 2^1) = M \times 62[7].
- Booth's multiplication algorithm's maintained by WikiProject is recorded as WikiProject Mathematics[8].
- Booth's multiplication algorithm's Microsoft Academic ID is recorded as 72475854[9].
- Booth's multiplication algorithm's OpenAlex ID is recorded as C72475854[10].
Body
Designation and Status
Booth's multiplication algorithm's instance of is recorded as multiplication algorithm[4].
History and Context
Andrew Donald Booth is named after Booth's multiplication algorithm[5].
Why It Matters
Booth's multiplication algorithm draws 147 Wikipedia views per month (multiplication_algorithm category, ranking #3 of 10).[2] It has Wikipedia articles in 14 language editions, a strong signal of global cultural recognition.[11] It is known by 3 alternative names across languages and contexts.[12]