Changes for version 0.20 - 2017-03-25
- ADDED
- Added the `remove(n,k)` and `bremove(n,k)` methods, for removing all occurrences of the factor k from integer n.
- IMPROVEMENTS
- Re-implemented the `mod` method based on the identity: x % y = x - y*floor(x/y), which always returns the exact result, assuming that x and y are rational numbers.
- FIXES
- Fixed a special case in modpow(x, y, z) when y < 0 and gcd(x, z) != 1.
- Fixed a minor issue in broot(x, y) when y is not an integer.
- Fixed a minor issue in bfpow(x, y) when y is a non-numeric scalar.
Modules
Arbitrary size precision for integers, rationals and floating-point numbers.
Represents the +/-Infinity value.
Represents the Not-a-Number value.
Examples
- examples/agm_pi.pl
- examples/arithmetic_coding.pl
- examples/bernoulli_numbers_recursive.pl
- examples/binary_arithmetic_coding.pl
- examples/binradix_arithmetic_coding.pl
- examples/closed_form_fib.pl
- examples/coin_change.pl
- examples/computing_pi.pl
- examples/faulhaber_s_formula.pl
- examples/fibonacci_validation.pl
- examples/inverse_of_factorial.pl
- examples/is_power.pl
- examples/miller_rabin_primality_test.pl
- examples/pi_machin.pl
- examples/power_pairs.pl
- examples/prime_count_approx.pl
- examples/rsa_algorithm.pl
- examples/tac-compressor.pl
- examples/zeta_2n.pl