A branch of mathematics commonly used in cryptography is Galois Fields GF(p[superscript n]). Two basic operations performed in GF(p[superscript n]) are the addition and the multiplication. While the addition is generally easy to compute, the multiplication requires a special treatment. A well-known method to compute the multiplication is based on…

Some current models of mathematical cognition (Dehaene, 1992; Campbell & Clark, 1992) make strong claims about the code in which arithmetical operations are solved, basing themselves on how these operations were originally acquired or are most frequently employed. However, data on acquisition and use are often derived from anecdotic reports…

Introduction: In the present-day didactic process of transition from natural numbers to integers, a certain kind of measure is involved which is neither easy nor appropriate to integrate into the familiar numerical systems. We refer to measures and comparisons for which we need a third numerical system--what we will call "relative…