DN>
  > JdeBP> The commentary in \BCOS2\SOURCE\RTL\COMMON\POW.ASM is too long to
  > JdeBP> post here, but reading it will reveal that Borland uses two separate
  > JdeBP> algorithms for implementing the pow() function (one of which is an
  > JdeBP> optimisation for powers of integers), along with a handful of code
  > JdeBP> to handle some special cases.
  >
  > Does that mean that my shot-in-the-dark was right?
DN>

  Yes.  Borland uses a specialised algorithm for X^Y when Y is an
  integer less than 2^64.

  > JdeBP <
___
 X MegaMail 2.10 #0:
--- Maximus/2 3.00