Changes for version 0.39 - 2022-06-11
- ADDITIONS
- Added the `addmod(a,b,m)`, `submod(a,b,m)` and `mulmod(a,b,m)` methods.
- Added the `chebyshevTmod(n,x,m)` and `chebyshevUmod(n,x,m)` methods.
- Added the `quadratic_powmod(a,b,w,n,m)` method.
- Added the `idiv_ceil(a,b)`, `idiv_trunc(a,b)`, `idiv_round(a,b)` methods.
- Added the `is_power_of(n,b)` method, which returns true if n is a power of b.
- CHANGES
- Changed `idiv(a,b)` to do floor-division instead of truncated-division.
- Return zero when k > n in subfactorial(n, k).
- IMPROVEMENTS
- Extended `divmod()` to support an additional argument.
- Optimization in `digits(n,b)` and `sumdigits(n,b)` for large n and b.
- Faster computation of `chebyshevT(n,x)` and `chebyshevU(n,x)` for large n.
- Less memory usage in `sumdigits(n,b=10)` for very large n.
Modules
Arbitrary size precision for integers, rationals, floating-points and complex numbers.
Examples
- examples/BPSW_primality_test.pl
- examples/PSW_primality_test.pl
- examples/agm_pi.pl
- examples/arithmetic_coding.pl
- examples/bernoulli_numbers_from_primes.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/inverse_of_fibonacci.pl
- examples/is_power.pl
- examples/krzysztof_reformulated_zeta_function.pl
- examples/lambert_W.pl
- examples/mandelbrot_set.pl
- examples/miller_rabin_primality_test.pl
- examples/newton_s_method.pl
- examples/partial_sums_of_sigma_function.pl
- examples/pi_machin.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