 trizen
|
f884606b8d
- Added the Number `prime_power_count_lower(n)` and `prime_power_count_upper(n)` methods.
|
2 years ago |
|
trizen
|
025e8aa9ac
Simplifications in the Number class.
|
2 years ago |
|
trizen
|
c8493b893f
- Minor optimization in `nth_semiprime(n)` for large n.
|
2 years ago |
|
trizen
|
5eb73f154d
- Added the Number `nth_powerfree(n, k=2)` method.
|
2 years ago |
|
trizen
|
e428b63250
Make sure k does not overflow in Number `nth_composite(n)` and `nth_squarefree(n)`.
|
2 years ago |
|
trizen
|
a25486d7ae
Adjusted bounds in Number `nth_squarefree(n)`.
|
2 years ago |
|
trizen
|
8c47ffd6a8
- Optimizations in Number `nth_composite(n)`.
|
2 years ago |
|
trizen
|
03006f7f0d
- Added the Number `nth_squarefree(n)` method.
|
2 years ago |
|
trizen
|
5633bf1c2a
Simplifications in Number `dop_factor` and `cop_factor`, by using `gcd_factors()`.
|
2 years ago |
|
trizen
|
272ec42727
- Added the Number `special_factors(n, tries=1)` method.
|
2 years ago |
|
trizen
|
ef7938a59d
- Added the Number `gcd_factors(n, [a,b,c,...])` method.
|
2 years ago |
|
trizen
|
57845ba183
- Added the `Math.binary_exp(c,x,n,{|a,b| ... })` method.
|
2 years ago |
|
trizen
|
e0370a8a02
Prevent infinite looping in Number `bsearch_inverse`.
|
2 years ago |
|
trizen
|
764eab5d9a
- Added the Number `next_prime_power(n)` method.
|
2 years ago |
|
trizen
|
bee1d25899
- Added the Number `k.smooth_divisors(n)` and `k.rough_divisors(n)` methods.
|
2 years ago |
|
trizen
|
b3b21baec8
- Fixed the lucas_factor(n) method on 32-bit systems.
|
2 years ago |
|
trizen
|
3c831cd569
squfof_factor(n,tries) now defaults to tries=1e4, when no value is given
|
2 years ago |
|
trizen
|
660429aca3
- Extended the Number `.factor` method to accept an optional block.
|
2 years ago |
|
trizen
|
fe757df40d
Use `Math::Prime::Util::primes()` in more places when `Math::Prime::Util` is available.
|
2 years ago |
|
trizen
|
f6c4333de3
- Added the Number `pell_factor(n, tries=1e5)` method.
|
2 years ago |
|
trizen
|
058b71fec5
Modified the result of `Math.gcd_factors(n,arr)` to multiply to `n`.
|
2 years ago |
|
trizen
|
590fc97440
- Optimziation in Number `sum_of_squares(n)`: factorize `n` only once.
|
2 years ago |
|
trizen
|
2ecf8bb5c7
- Added the RangeNumber methods: `each_prime_power(a..b, {...})`, `prime_power_count(a..b)` and `prime_powers(a..b)`.
|
2 years ago |
|
trizen
|
ae687b8669
- Added the Number `prime_powers(a,b)` and `prime_powers_each(a,b,{...})` methods.
|
2 years ago |
|
trizen
|
806e7c08e5
- Try to use `Math::Prime::Util` where possible, even when it's an older version.
|
2 years ago |
|
trizen
|
fc14efe1ba
REPL: call `.dump` on the result objects.
|
2 years ago |
|
trizen
|
39ba86fc31
- Added the Number `cyclotomic_factor(n, bases...)` method.
|
2 years ago |
|
trizen
|
9c4c74f055
- Added the Number `is_perfect(n)` method.
|
2 years ago |
|
trizen
|
284edd3291
- Use `Math::Prime::Util::allsqrtmod(a,n)` in Number `sqrtmod_all(a,n)` for native integers.
|
2 years ago |
|
trizen
|
462b78ecac
- Optimization in Number `sum_of_squares(n)`.
|
2 years ago |
