 trizen
|
97d776fcab
Version 22.07
|
1 year ago |
|
trizen
|
1a7812a0ae
- Added the Number `n.is_squarefree_almost_prime(k=2)` method.
|
1 year ago |
|
trizen
|
f1c30f55da
- Added the Number `n.next_squarefree_almost_prime(k=2)` method.
|
1 year ago |
|
trizen
|
6023b93148
- Added the Number `n.next_omega_prime(k=2)` method.
|
1 year ago |
|
trizen
|
727d990036
Use `Math::Prime::Util::nth_omega_prime` only when the output is a native integer.
|
1 year ago |
|
trizen
|
271fcdb2f6
- Added the Number `nth_squarefree_almost_prime(n, k=2)` method.
|
1 year ago |
|
trizen
|
bbc89237bb
- Added the Number `nth_omega_prime(n,k=2)` method.
|
1 year ago |
|
trizen
|
38160a9bcd
Make sure that `Math::Prime::Util::almost_prime_count(k,n)` works correctly.
|
1 year ago |
|
trizen
|
277fe12b14
- Extended the Math.seq() function to call the given block with the index of the current term (1-based).
|
1 year ago |
|
trizen
|
0fd19d4da8
- Added the `Math.seq(a, b, c, ..., { ... })` method.
|
1 year ago |
|
trizen
|
8a45f5f5b8
- Optimized `next_almost_prime(n,k)` for large `n` and `k <= 23`.
|
1 year ago |
|
trizen
|
4295892eee
- Added the Number `next_semiprime(n)` method.
|
1 year ago |
|
trizen
|
9608c7ff64
- Added the Number `next_almost_prime(n,k=2)` method.
|
1 year ago |
|
trizen
|
79c5c5a067
- Added the Number `next_powerful(n, k=2)` method.
|
1 year ago |
|
trizen
|
3d61414744
- Added the Number `nth_almost_prime(n, k=2)` method.
|
1 year ago |
|
trizen
|
5485e847fa
- Added the Number `n.next_powerfree(k=2)` method.
|
1 year ago |
|
trizen
|
40c833c5bd
Bring back the previous implementation of the prime-counting function, as it is singinificantly faster for large n.
|
1 year ago |
|
trizen
|
e1180f3c9a
Much better performance in `nth_powerful(n,k)` for large n and k.
|
1 year ago |
|
trizen
|
7d8d695522
- Added the Number `nth_powerful(n,k=2)` method.
|
1 year ago |
|
trizen
|
2f095cbc25
Use also `pbrent_factor(n, m*1e5)` in `special_factor(n,m=1)`, for finding small prime factors of n (up to ~10^10).
|
1 year ago |
|
trizen
|
06fdc3f384
Extra-optimizations in Number `is_almost_prime(n,k)` and `is_omega_prime(n,k)` for large n.
|
1 year ago |
|
trizen
|
32031b055a
Extra-optimization in Number `is_almost_prime(n,k)` and `is_omega_prime(n,k)` for n >= 10^60.
|
1 year ago |
|
trizen
|
757896c1db
Some extra-optimizations in Number `is_almost_prime(n,k)` and `is_omega_prime(n,k)` for very large value of `n`.
|
1 year ago |
|
trizen
|
ac7039230e
- Optimized Number `is_omega_prime(n,k)` for much better performance for large n and k.
|
1 year ago |
|
trizen
|
a77b68a439
Minor optimizations in Number `special_factor(n)`.
|
1 year ago |
|
trizen
|
c6188a9c9e
- Optimizations in Number `is_almost_prime(n,k)` for large n.
|
1 year ago |
|
trizen
|
9e4b34e26c
- Added the Number `nth_prime_power(n)` method.
|
1 year ago |
|
trizen
|
6c481306a6
- Added the Number `composite_lower(n)` and `composite_upper(n)` methods.
|
1 year ago |
|
trizen
|
dc92b4cd7a
- Added the Number `composite_count_lower(n)` and `composite_count_upper(n)` methods.
|
1 year ago |
|
trizen
|
2d5efab079
- Added the Number `prime_power_lower(n)` and `prime_power_upper(n)` methods.
|
1 year ago |
