Changes for version 0.09 - 2017-05-30
- ADDITIONS
- Added the `is_coprime(n, k)` function.
- IMPROVEMENTS
- Minor simplification for `eta(1)`.
- Minor optimization in `rand()` without arguments (when exported).
- Extended the `rat(str)` function to parse a given decimal expansion as an exact fraction.
- Re-implemented the `ilog(x, y)` function for better performance and to correctly handle arbitrary large integers.
- PERFORMANCE IMPROVEMENTS
- ~4x faster algorithm in `bernfrac(n)`, due to Kevin J. McGown.
Modules
Arbitrary size precision for integers, rationals, floating-points and complex numbers.
Examples
- examples/agm_pi.pl
- examples/arithmetic_coding.pl
- examples/bernoulli_numbers_recursive.pl
- examples/bernoulli_seidel.pl
- examples/binary_arithmetic_coding.pl
- examples/binradix_arithmetic_coding.pl
- examples/computing_pi.pl
- examples/faulhaber_s_formula.pl
- examples/fibonacci.pl
- examples/fibonacci_validation.pl
- examples/halley_s_method.pl
- examples/inverse_of_factorial.pl
- examples/is_power.pl
- examples/lambert_W.pl
- examples/miller_rabin_primality_test.pl
- examples/newton_s_method.pl
- examples/pi_machin.pl
- examples/power_pairs.pl
- examples/prime_count_approx.pl
- examples/rsa_algorithm.pl
- examples/solve_pell_equation.pl
- examples/tac-compressor.pl
- examples/tribonacci.pl
- examples/zeta_2n.pl
- examples/zeta_2n_fast.pl