Changes for version 0.22 - 2018-02-17
- ADDITIONS
- is_smooth(n, k) :: returns a true value when all the prime factors of `n` are <= `k`
- polymod(n, a, b, c, ...) :: computes the polymod of `n` against a list of numbers.
- subfactorial(n,k) :: computes the number of derangements of a set with `n` elements with `k` fixed points.
- multinomial(a, b, c, ...) :: computes the multinomial coefficient.
- IMPROVEMENTS
- Minor performance improvement in the `mod(n,k)` method when `k` fits into a native unsigned integer.
- OTHER
- Using the integer limits from Math::GMPq instead of POSIX. This makes POSIX no longer needed.
Modules
Arbitrary size precision for integers, rationals, floating-points and complex numbers.
Examples
- 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/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/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