Agena

agena >> `The Power of Procedural Programming` 6.3.6 Lookout Mountain, November 02, 2025 - New `mapm.xgcd` and `mapm.xlcm` compute the Greatest Common Divisor and Least Common Multiple of two arbitary-precision numbers. - New `mapm.xmulmod` and `mapm.xpowmod` conduct modular multiplication (a*b % m) and exponentiation (a^b % m), respectively. - New `mapm.xinvmod` calculates the modular multiplicative inverse of 'a' modulo 'm'. - The `mapm` modulo operation (`%`, `mapm.xmod`) has become 25 percent faster. - `mapm` package: When raising a number to an integral power with the `**` or `^` operators or `mapm.xipow`, `mapm.xpow`, you no longer have to manually adjust the precision with `mapm.xdigits` to get correct results. - Likewise, the bitwise operators `&&`, `||`, `^^` now internally auto-adapt to the required precision to avoid round-off errors with very large numbers. Same with `mapm.xterm`, `mapm.xexp2`, `mapm.xexp10` and complex number exponentiation. - `numtheory.powmod` with negative integral exponents (second argument) has been tuned a bit. - When given more than two arguments, `numtheory.gcd` and `numtheory.lcm` left memory leaks. This has been fixed.