Report
Egyptian multiplication and some of its ramifications
| العنوان: | Egyptian multiplication and some of its ramifications |
|---|---|
| المؤلفون: | van Emden, M. H. |
| سنة النشر: | 2019 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Mathematics - Numerical Analysis, Computer Science - Programming Languages, G.1.0 |
| الوصف: | Multiplication and exponentiation can be defined by equations in which one of the operands is written as the sum of powers of two. When these powers are non-negative integers, the operand is integer; without this restriction it is a fraction. The defining equation can be used in evaluation mode or in solving mode. In the former case we obtain "Egyptian" multiplication, dating from the 17th century BC. In solving mode we obtain an efficient algorithm for division by repeated subtraction, dating from the 20th century AD. In the exponentiation case we also distinguish between evaluation mode and solving mode. Evaluation mode yields a possibly new algorithm for raising to a fractional power. Solving mode yields the algorithm for logarithms invented by Briggs in the 17th century AD. Comment: 7 pages and 6 figures |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/1901.10961 |
| رقم الانضمام: | edsarx.1901.10961 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |