| .. |
|
almost_and_omega_primes.sf
|
30aead5dd0
Ignore trial-division factors when looking for special factors in Number `_factor(n)`.
|
4 months ago |
|
binomialmod.sf
|
b78758147c
- Optimized Number `ipow2(n)` and `ipow10(n)` when the result is a native integer.
|
5 months ago |
|
carmichael_with_n_factors.sf
|
40404a7df6
modified: NUMBER_THEORY_TUTORIAL.md -- added more content
|
7 months ago |
|
chebyshev_factorization_method.sf
|
f12733ccbd
new file: scripts/Extended tests/chebyshev_factorization_method.sf
|
2 years ago |
|
combinatorics.sf
|
054b19fa90
Replaced http:// with https:// in Sidef scripts.
|
5 months ago |
|
digits2num.pl
|
058b71fec5
Modified the result of `Math.gcd_factors(n,arr)` to multiply to `n`.
|
1 year ago |
|
elementary.sf
|
f72e891a33
- Return false from Number `is_strong_psp(n, b)` when `gcd(n,b) != 1`.
|
4 months ago |
|
fermat_pseudoprimes.sf
|
5925312284
- Faster generation of Fermat pseudoprimes `n` with `omega(n) = 1`.
|
1 year ago |
|
fermat_pseudoprimes_to_base_n.sf
|
8a4ae7197b
Version 23.03
|
1 year ago |
|
fermat_with_n_factors.sf
|
5925312284
- Faster generation of Fermat pseudoprimes `n` with `omega(n) = 1`.
|
1 year ago |
|
fermat_with_n_factors_to_base_n.sf
|
8a4ae7197b
Version 23.03
|
1 year ago |
|
floor_ceil.sf
|
2336702f8d
Added 3 more test files.
|
6 months ago |
|
inverse_of_multiplicative_functions.sf
|
4bc9723263
Number: return native integers from `_dynamic_preimage()` when possible.
|
1 year ago |
|
inverse_sigma.sf
|
1b511becf5
- No longer cache the value of 1/3 in cbrt for complex numbers.
|
2 years ago |
|
is_almost_prime.sf
|
30aead5dd0
Ignore trial-division factors when looking for special factors in Number `_factor(n)`.
|
4 months ago |
|
is_carmichael.sf
|
5d478d9a9b
- Fixed `gcd(-n)` and `lcm(-n)` to return `n` instead of `-n`.
|
1 week ago |
|
is_omega_prime.sf
|
de88fe0e57
- Added the Number `solve_quadratic_form(d, n)` method.
|
5 months ago |
|
is_over_psp.sf
|
da14bf9aaf
- Several more optimizations in the Number class.
|
1 year ago |
|
is_super_psp.sf
|
689de07b09
- Several optimizations in the Number class.
|
1 year ago |
|
lucas_carmichael_negative.sf
|
25df4d76b6
Minor performance tweaks in Number `miller_factor(n)` and `lucas_factor(n)`.
|
5 months ago |
|
lucas_carmichael_positive.sf
|
25df4d76b6
Minor performance tweaks in Number `miller_factor(n)` and `lucas_factor(n)`.
|
5 months ago |
|
lucas_carmichael_with_n_factors.sf
|
40404a7df6
modified: NUMBER_THEORY_TUTORIAL.md -- added more content
|
7 months ago |
|
lucas_sequences.sf
|
216b02a266
Added more extended tests.
|
2 years ago |
|
mertens_function.sf
|
216b02a266
Added more extended tests.
|
2 years ago |
|
misc_number_tests.sf
|
2f6a1f8aae
- Parse 'ZERO WIDTH SPACE' (U+200B) as whitespace.
|
2 months ago |
|
nth_prime.sf
|
fc781e4322
- Use `primecount` in Number `nth_prime(n)` when `n` is large enough and `Num!USE_PRIMECOUNT` is enabled.
|
1 year ago |
|
nth_prime_near_powers_of_10.sf
|
216b02a266
Added more extended tests.
|
2 years ago |
|
number_methods.sf
|
2074f273c6
Fixed a minor issue in Number `is_powerful(n,k)`: return false if `n` is negative and `k == 1`.
|
4 months ago |
|
oeis_sequences.sf
|
2be17924e3
- No longer `use integer` in Number `smooth_count`.
|
7 months ago |
|
prime_bounds.sf
|
216b02a266
Added more extended tests.
|
2 years ago |
|
prime_count.sf
|
216b02a266
Added more extended tests.
|
2 years ago |
|
prime_power_count.sf
|
47aa40a702
`Num(str, base)` now returns a blessed native integer, when possible.
|
10 months ago |
|
pseudoprimes.sf
|
8a4ae7197b
Version 23.03
|
1 year ago |
|
range_sum.sf
|
216b02a266
Added more extended tests.
|
2 years ago |
|
sqrtmod.pl
|
058b71fec5
Modified the result of `Math.gcd_factors(n,arr)` to multiply to `n`.
|
1 year ago |
|
squarefree_pseudoprimes.sf
|
d4af5023ca
Slightly faster generation of non-squarefree Fermat pseudoprimes.
|
1 year ago |
|
strong_fermat_pseudoprimes_to_base_n.sf
|
8a4ae7197b
Version 23.03
|
1 year ago |
|
strong_fermat_with_n_factors.sf
|
5925312284
- Faster generation of Fermat pseudoprimes `n` with `omega(n) = 1`.
|
1 year ago |
|
strong_fermat_with_n_factors_to_base_n.sf
|
8a4ae7197b
Version 23.03
|
1 year ago |
|
sumdigits.pl
|
058b71fec5
Modified the result of `Math.gcd_factors(n,arr)` to multiply to `n`.
|
1 year ago |
|
tie_berkeley_db.sf
|
8aa1284a79
- Added the `%perl{...}` and `%Perl{...}` syntax for executing arbitrary Perl code.
|
1 year ago |
|
tie_berkeley_db_recno.sf
|
8aa1284a79
- Added the `%perl{...}` and `%Perl{...}` syntax for executing arbitrary Perl code.
|
1 year ago |
|
tie_gdbm_db.sf
|
8aa1284a79
- Added the `%perl{...}` and `%Perl{...}` syntax for executing arbitrary Perl code.
|
1 year ago |
