Changes for version 0.29 - 2018-11-11
- ADDITIONS
- is_smooth_over_prod(n,k) return 1 if n is smooth over the primes p|k
- IMPROVEMENTS
- Much faster algorithm in `is_smooth(n, k)`.
- Cached the values of the `bernoulli(n)` function for `n <= 500`.
- Also cached the Bernoulli numbers that are internally used in `bernoulli_polynomial(n, x)` and `faulhaber_sum(n, k)`.
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