Turning Egyptian Division Into Logarithms -- David Sanders

Insights I've had while reading Elements of Programming and From Mathematics to Generic Programming

Turning Egyptian Division into Logarithms

by David Sanders

From the article:

I have benefitted greatly from multiple readings of Elements of Programming by Alexander Stepanov and Paul McJones as well as From Mathematics to Generic Programming by Stepanov and Daniel Rose. Each time I read either work, I learn something new.

In this article, I describe an extension to the ancient Egyptian division algorithm to yield logarithm and remainder in addition to quotient and remainder.

Add a Comment

Comments are closed.

Comments (1)

0 0

ramey said on Aug 12, 2016 12:15 PM:

Nicely done.

Please excuse me for plugging my session at CppCon on related topics

https://cppcon2016.sched.org/event/7nM7/c-abstract-algebra-and-practical-applications?iframe=yes&w=i:700;&sidebar=yes&bg=no#?iframe=yes&w=i:700;&sidebar=yes&bg=no

Any one who finds your article interesting - as I do - might be interested in this session as well.

Robert Ramey