Werner…
Prime 3.0 (at least) has the time() function, so I was able to duplicate your program. However, rather than play around with matrix inversions, I substituted other operations for dummy. The fastest operation I found so far was dummy<— 0, which gave me two results: 0.000000000000000 ns and 9.999275207529530 ns. Image may be NSFW.
Clik here to view.
Of course, this level of precision is absurd, so let's just say 0 ns (7 out of 10 times) and 10 ns (3 out of ten times). dummy<— log(n) produced a variety of results ranging between about 130 ns and 210 ns.
BTW, I'm using a 2.5 GHz quad-core Dell Latitude E5520 (Core i5 processor)
All this proves your point below that timing in Mathcad isn't that accurate.
Fred
