Changes for version 0.11 - 2017-07-11
- IMPROVEMENTS
- Extended the `rising_factorial(n, k)` and `falling_factorial(n, k)` for negative values of `k`.
- PERFORMANCE IMPROVEMENTS
- Optimized `eta(n)` and `zeta(n)` for values of `n` that fit inside a native unsigned integer.
- OTHER
- Fixed the number of skipped tests under old versions of GMP in t/integer_functions.t.
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/krzysztof_reformulated_zeta_function.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