





In the above benchmark for the Commands Multiply, Divide and Square Root the numbers n1 = n2 = 12345678901234567890 and
n3 = 152415787532388367501905199875019052100 are used
For the Commands Mod Ex, "Get Prime" and Fermat the prime numbers n5 = 3347831 and n6 = 3674609 are used
When you compare the results of Table 1, Table 2 and Table 3:
The display shows the following functions:




rem = A(In) Div=A(Div) A(Quotient) = zero Do tempin = rem/Div A(temp) = tempin A(Quotient) = A(Quotient)+A(temp) A(in2) = A(Quotient) * A(Div) A(rem) = A(in)  A(in2) rem = A(rem) Loop until tempin < 1 
The program uses the following arrays: A(in),A(Div),A(Quotient),A(rem),A(temp) and A(in2) The numbers: rem,Div and tempin are double precision floating point numbers. 
Back to my home page Contents of This Document