1 dzień temu 0 commitów w master od tego wydania
fibonorial(n)
method. (b8119015a7
)is_primitive_abundant(n)
method. (eb11b34026
)4aa0032e5e
)40c23f83e9
)powerful_count
. (387da411be
)100f7d86f5
)n
in is_carmichael(n)
. (02b1ab3f32
)iter
for native integers and step=1
. (5521bbfb0c
)_primality_pretest()
: when n > 10^50_000
, try gcd with primorial(10^9)
(on 64-bit systems). (2e990316a4
)U+200B
) as whitespace. (2f6a1f8aae
)is_strong_psp(n, b)
when gcd(n,b) != 1
. (f72e891a33
, 9b833eb24b
)is_pseudoprime(n,b)
for better consistency. (f72e891a33
)use VERSION
in eval()
(ready for Perl 5.40). (acdaf87efe
)gcd(-n)
and lcm(-n)
to return n
instead of -n
. (5d478d9a9b
)-O1
. (95471823cb
)All changes: https://github.com/trizen/sidef/compare/24.01...24.05
P.S.: This is a minor release, preparing Sidef for Perl 5.40.
4 miesięcy temu 21 commitów w master od tego wydania
Num!USE_PFGW
class-variable. (disabled by default) (04e7c13d23
, 65ee3494ca
)znlog(a, g, m)
method. (c9ba93e633
)geometric_summod(n, r, m)
method. (fe5852e01b
)centered_pyramidal(n,k)
method. (0f76bd941a
)centered_pyramidal_root(n,k)
method. (0f76bd941a
)antidivisors(n)
and antidivisor_count(n)
methods. (c733f796ea
)antidivisor_sum(n)
method. (d8d9ca3f43
)pisano_period(n)
method. (2b750d7233
)solve_quadratic_form(d, n)
method. (de88fe0e57
)smod(a, m)
method. (aa825eff2d
)germain_factor(n)
method. (ac72a2b245
){ ... }.nest(n, initial_value=0)
method. (f904fc4cf0
).summod(m)
and .prodmod(m)
methods. (12dc78bc17
)-i
). (f1c1848ed7
)6925ddc38c
)426346ec4c
)idiv_ceil(a,b)
for native positive integers. (0a9cd662c4
)0a9cd662c4
)_primality_pretest(n)
from _is_prob_prime(n)
for large enough n
. (8dc1329e0b
)_factor(n)
. (30aead5dd0
)is_almost_prime(n,k)
and is_omega_prime(n,k)
for slightly better performance. (30f35b60b6
)is_prob_prime(n)
and all_prime(...)
for n < 10^1000
. (858add247d
)ipow2(n)
and ipow10(n)
when the result is a native integer. (b78758147c
)n.remove(k)
for native integers. (d99908ca1e
)_big2istr()
, _big2uistr
and _big2pistr()
private functions. (164425cbf8
)is_mersenne_prime
. (038de75144
)factorial_valuation(n,p)
for native integers. (67377c2647
)204dc7d08d
)is_carmichael(n)
and is_lucas_carmichael(n)
. (74c5901617
, 294f4a3cf3
, 25df4d76b6
)PolyMod
objects as x^k + ... + c (mod m)
. (6847de685f
)5930a89e2d
)Set
and Bag
objects to be used as arrays. (3202fada09
)lucas_factor(n,j,tries)
when j
is nil
. (25327caa07
)731abe594d
)1e97aaeaa7
)\
) character. (5930a89e2d
)is_powerful(n,k)
: return false if n
is negative and k == 1
. (2074f273c6
)All changes: https://github.com/trizen/sidef/compare/23.11...24.01
6 miesięcy temu 70 commitów w master od tego wydania
PolyMod([...], m)
built-in class. (fe8303dc15
)chinese(...)
method. (fada3757d0
)factor(z)
and factor_exp(z)
methods. (8827635f58
)divisors(z)
method. (805442fde4
)is_bfsw_psp(n)
method. (762af27ec9
)totient_range(a,b)
method. (17aa258024
)proper_sigma0(n)
method. (17aa258024
)proper_divisors(n)
method. (17aa258024
)mobius_range(n)
method. (17aa258024
)is_deficient(n)
method. (17aa258024
)is_amicable(n,m)
method. (17aa258024
)linear_congruence(n, r, m)
method. (219320bbc5
)bphi(n)
method. (a121ecd611
)iphi(n,k=1)
method. (68049c417a
)nuphi(n)
method. (8bd9444c70
)4d182796f7
)modular_quadratic_formula(a,b,c,m)
when gcd(2*a, m) == 1
. (6f88a08660
)special_factor(n)
. (bae4ff1c27
)aliquot(n)
method to accept an extra argument. (17aa258024
)trial_factor(n,lim)
. (1b781e9d97
)is_powerful(n,k)
. (455eeedf52
)is_div(n,k)
for native integers. (15dc48239e
)k.powerful_count(n)
for non-native n
. (9d131a7efe
)divisors(n,k)
method for better performance. (e662b70a14
)phi
and uphi
methods to accept an extra argument. (af72440d81
)modular_quadratic_formula(x,y,z,m)
for x != 1
. (219320bbc5
)irand(0,x)
. (f92fbc5943
)is_almost_prime(n,k)
and is_omega_prime(n,k)
. (bc745ebd78
)6e4ba2acd7
)Range::Range
, Block::Try
and Block::Fork
real objects, by inheriting from Sidef::Object::Object
. (53224896d8
)All changes: https://github.com/trizen/sidef/compare/23.10...23.11
6 miesięcy temu 96 commitów w master od tego wydania
Num!USE_PARI_GP
class-variable (disabled by default). (12fe3dbc35
bd13ad07f8
)Num!USE_CONJECTURES
class-variable (disabled by default). (43b8165fef
)is_bfw_psp(n)
method. (218aa60391
)Poly(str)
. (819a5aed13
).bsearch_min{...}
, .bsearch_max{...}
, .bindex_min{...}
and .bindex_max{...}
methods. (70d81cbb43
)File.link
and File.symlink
methods. (cf029ea418
379f1a640c
)3d5c1bab9e
1d2f6a9c8e
)arr.ordered_partitions(k, { ... })
method. (6378d47bcb
)include("file.sf")
statement. (865857faff
)irand
method. (5e5c7e45d9
)primality_pretest(n)
method for n > 10^1000
. (38f844ba22
)1dbbf7e90a
, 919bfb3763
)is_almost_extra_strong_lucas_pseudoprime
in Number all_prime
and is_safe_prime
. (d066781d0c
)5e5c7e45d9
)is_square(n)
, is_cube(n)
and is_power(n,k)
for native integers. (3bbff08b86
)special_factor(n)
. (68a6048a99
)nth_powerfree(n,k)
for k = 2
. (e0016221f9
)next_perfect_power(n)
and prev_perfect_power(n)
. (81af8f018c
)is_prob_prime(n)
method to use the Frobenius-Underwood test. (38f844ba22
)4f34c47380
)Sidef::Module::OO
object from Block.thread()
. (76c87b23e9
)use integer
in Number smooth_count
. (2be17924e3
).pow(n)
method to accept an arbitrary large integer. (574d6a53b2
)prime_count(a,b)
when a
and b
are close to each other. (7e53839c8c
)lt
, le
, gt
and ge
methods. (9626332738
).le
, .lt
, .gt
and .ge
methods. (5d543a8f02
)perl < 5.24.0
. (67a636a999
d1ee265336
)All changes: https://github.com/trizen/sidef/compare/23.08...23.10
8 miesięcy temu 144 commitów w master od tego wydania
Num!USE_PRIMESUM
class-variable. (disabled by default) (28e2ac365f
)lpf_sum(a,b)
method. (9c70da2bc2
)gpf_sum(a,b)
method. (096ead5857
)k.squarefree_almost_prime_sum(a,b)
method. (601bb750cd
)k.almost_prime_sum(a,b)
method. (6b1d971ab1
)prime_power_sum(n)
method. (90d77d9d1d
)k.omega_prime_sum(a,b)
method. (d2381391d7
)k.power_count(a,b)
and k.power_sum(a,b)
methods. (19cd8c95eb
)perfect_power_sum(n)
method. (c799a1c6dd
)nth_perfect_power(n)
method. (ab462f6e62
)next_perfect_power(n,k=nil)
and prev_perfect_power(n,k=nil)
methods. (5c195e3a0c
)prev_prime_power(n)
method. (e51de620e4
)n.prev_omega_prime(k=2)
method. (44c3723fcb
)prev_semiprime(n)
method. (ad8928b3c2
)prev_almost_prime(n,k)
method. (ad8928b3c2
)prev_squarefree(n)
method. (cb6917daa3
)next_squarefree_semiprime(n)
method. (a6e26d0f4b
)n.prev_powerfree(k=2)
method. (8457fd4806
)n.prev_powerful(k=2)
method. (8d4907f797
)n.prev_squarefree_semiprime
method. (6da4bba757
)n.prev_squarefree_almost_prime(k=2)
method. (6da4bba757
)nth_nonpowerfree(n,k)
method. (6cc777f36d
)next_nonpowerfree(n,k=2)
and prev_nonpowerfree(n,k=2)
methods. (809aa9bdd6
)muladdmulmod(a, b, c, d, m)
and mulsubmulmod(a, b, c, d, m)
methods. (9e230f4d1d
)muladdmod(a,b,c,m)
, mulsubmod(a,b,c,m)
and submulmod(a,b,c,m)
methods. (d50ffde020
)cube_*
and cubefree_*
aliases for 3.power_*
and 3.powerfree_
. (bb0784e3ef
).rewind
method. (3b4043861e
).codes
method. (6da6122aa4
).sort {|a,b| ... }
and .sort_by {|v| ... }
methods. (1eacc45b15
)fibmod
method to accept 3 arguments. (b79e09d082
)expnorm(n,b)
to accept any value for base b
, including a complex number. (b79e09d082
)primecount --phi
in Number k.rough_count(n)
when Num!USE_PRIMECOUNT
is enabled. (28e2ac365f
)cop_factor(n)
to potentially find more factors. (a2cdf754c0
)gamma
method to be called as Num.gamma
, returning the Euler-Mascheroni constant. (b79e09d082
)mertens(2**n)
and mertens(2**n)
. (e9ebca02b2
)faith
rounding option for -M
, which does faithful rounding (with mpfr >= 4.0.0
). (fde163acbb
)is_omega_prime(n,k)
and is_almost_prime(n,k)
for large n
. (abc0c1ec17
)Num(str, base)
now returns a blessed native integer, when possible. (47aa40a702
)almost_prime_count()
lookup tables. (56b16a3c41
)nth_almost_prime(n,k)
when the result doesn't fit inside a native integer. (b6afa3ddc1
)k.almost_primes(a,b)
and k.omega_prime_count(a,b)
when the GitHub version of Math::Prime::Util is installed.fibonacci(n,k)
for k >= 3
and large enough n
. (bf9f8b90fd
)_is_prob_prime
internal function. (769708358d
)k.non_powerfree(a,b)
method to k.nonpowerfree(a,b)
. (384eb06551
).slice(offset, length)
methods. (68d11ff609
, 11887b8160
, 724882efc4
).partitions
method to .partition_count
, which better reflects what it returns. (34c2fc9a75
)*squareful*
and *cubeful*
methods to *squarefull*
and *cubefull*
respectively. (543349163d
).ft(i,j)
method. (724882efc4
)help
command inside the REPL. (efa54f179c
)457560033d
)divmod(a,b,m)
introduced in version 22.05
, when a
is evenly divisible by b
. (48fcbbe1bc
)1 rok temu 205 commitów w master od tego wydania
36f6bc0610
)%perl{...}
and %Perl{...}
syntax for executing arbitrary Perl code. (8aa1284a79
)Perl.tie()
and Perl.untie()
methods. (23724746d5
)urand(a,b)
and useed(n)
methods. (f7f6db39e8
, 44a6c4bc3b
)euler_numbers(n)
method. (4ae86982d9
)bernoulli_numbers(n)
method. (45733ffaf3
)addmulmod(x, y, z, m)
method. (47c4117c6f
)fubini(n)
and fubini_numbers(n)
method. (fcf86d131a
)composite_sum(a,b,k=1)
method. (35f1f43fd0
)k.powerful_sum(a,b)
method. (69846960a3
)k.non_powerfree(a,b)
method. (f2c430dd6c
)k.non_powerfree_each(a, b, { ... })
method. (6b2133f2d1
)k.non_powerfree_count(a,b)
and k.non_powerfree_sum(a,b)
methods. (fce01532a5
)k.powerfree(a,b)
and k.powerfree_each(a,b,{...})
methods. (5e30232f87
)is_non_powerfree(n,k)
, is_non_squarefree(n)
and is_non_cubefree(n)
methods. (11056418ac
)roots_of_unity(n)
method. (0afea1e466
)inv
, powmod
and invmod
methods. (7c3a7ec888
)neg
method. (4a6c5a6366
).each_slice(n, {...})
method. (b984aa2a2c
).each_kv{|k,v| ... }
method. (8dca2c60e1
).uniq
method. (bbedb55f60
).time
method. (2adaae1211
).bsearch
, .bsearch_le
, .bsearch_ge
and bsearch_inverse
methods. (d2759930c2
, 5bf031f1bd
)roots(f)
method. (a3397e843d
)newtwon_method(f, x=1i)
method. (a3397e843d
).open_arw
method. (a5baa6cdec
)FileHandle.new_buf(encoding=:utf8)
class method. (a5baa6cdec
)<<
operator, to accept multiple arguments. (e3c65361c8
)is_squarefree(n)
, is_powerfree(n,k)
and is_powerful(n,k)
for native n
. (f37ac37e73
)db4692bc9f
)ilog(n,b)
for native n
. (18f62bdab7
)is_abs_euler_psp(n)
for native n
. (2e7480aa31
)chebyshev_factor(n)
. (2e7480aa31
)k.powerful_count(n)
for native and large n
. (7636988096
)prime_power_count(n)
, k.omega_prime_count(n)
, k.almost_prime_count(n)
and k.squarefree_almost_prime(n)
. (88a6131b49
)floor(a/b)
and ceil(a/b)
into a native integer, if possible. (88a6131b49
)squarefree_count(n)
. (c36fad357a
)nth_composite(n)
, nth_prime(n)
, nth_prime_power(n)
and nth_semiprime(n)
for non-native integers n
. (914595f69c
)primecount
in Number nth_prime(n)
when n
is large enough and Num!USE_PRIMECOUNT
is enabled. (fc781e4322
)f741a5e31b
, 68198cfed7
, 7e284dd0a6
, 4a6c5a6366
)sum(...)
for native integers. (7869c37d2d
)divmod(a,b,m)
for native integers. (b5b1117393
, 8b94722248
)68198cfed7
)idiv(a,b)
for native inputs. (ca17233536
)all_prime(...)
for native inputs. (9b796c6d29
)powmod(a,n,m)
for native inputs. (3de883d50f
)n.is_coprime(k)
when either n
or k
is a native integer. (3de883d50f
)gcd(a,b)
when either a
or b
is a native integer. (3de883d50f
)digits2num
for native integers. (428490dece
, 5463548435
)n.jordan_totient(k)
for large n
. (391d4ae193
)digits(n,b)
and sumdigits(n,b)
for native inputs. (dbff96aa6c
)n.as_bin
, n.as_oct
and n.as_hex
for native integers n
. (dbff96aa6c
)div(q,n)
where n
is a Number object. (dbff96aa6c
)is_abundant(n)
for large n
and native n
. (cc724a2afd
)f13784927d
)znorder(a,n)
and lambda(n)
for large n
. (1fd66bd739
)special_factor(n)
. (2a47419704
)f
suffix. (daf91ade2a
).open_r
. (e3c65361c8
).open_r
method to accept an optional argument specifying the encoding, which by default is utf8
. (a5baa6cdec
)3199b46620
)~~
) (12f9e2f66c
)random_safe_prime(n)
to random_nbit_safe_prime(n)
. (f741a5e31b
)hex
, oct
and bin
to return 0
for an empty string (instead of NaN
). (f741a5e31b
)+
sign as part of a number. (68198cfed7
)-
as part of a number. (4a6c5a6366
)Number(...)
. (575792eef5
)Polynomial()
, when the zero coefficient is passed for a power. (787cf8d314
)as_cfrac(n)
for rationals and native integers. (bb302652d9
)RAT % INT
to be consistent with INT % INT
when the modulo is negative. (7869c37d2d
)_set_int(n)
when n
is a Perl string with leading zeros. (3de883d50f
)ecf99e60a7
)is_almost_prime(n,k)
and is_omega_prime(n,k)
for numbers n
that contain the prime factor 101
. (1c16e5f9c5
)is_lucas_carmichael(n)
for native integers n
. (522e4ba951
)1 rok temu 337 commitów w master od tego wydania
f
suffix for literal numbers. (81b0991139
)cc5638bd10
).solve_rec_seq
method. (9a7e3d723b
).solve_seq(array, offset=0)
and .solve_rec_seq(array)
methods. (9a7e3d723b
).linear_recurrence(ker, init, n)
method. (a45fe514a7
).linear_recmod(ker, init, n, m)
method. (51c4688457
)phi_finder_factor(n, tries=1e4)
method. (2605b846d9
)k.carmichael(a, b)
method. (a884fcb067
)k.lucas_carmichael(a,b)
method. (a884fcb067
)k.squarefree_fermat_psp(base, a,b)
method. (a884fcb067
)k.carmichael_each(a,b,{...})
method. (c53381a32d
)k.lucas_carmichael_each(a,b,{...})
method. (c53381a32d
)k.squarefree_fermat_psp_each(base,a,b,{...})
method. (c53381a32d
)k.fermat_psp(base, A, B)
and k.fermat_psp_each(base, A, B, {...})
methods. (9437e8f881
)k.squarefree_strong_fermat_psp(base, a, b)
method. (c68292afba
)k.carmichael_strong_fermat(base, from, upto)
method. (7c9961c75e
)k.carmichael_strong_fermat_each(base, from, upto, { ... })
method. (a6376ee91f
)k.each_squarefree_strong_fermat_psp(base, from, upto, { ... })
method. (d3108ebf0f
)k.strong_fermat_psp(base, from, upto)
method. (e98114d6fd
)k.each_strong_fermat_psp(base, from, upto, { ... })
method. (277f5d49d4
)x.is_float
method. (e85866de3b
)aliquot(n)
method. (c1f16a8e06
)prev_composite(n)
method. (6045096967
)n.prev_primes(start)
method. (1d76f26956
)n.prev_composites(start)
method. (cfb857a80c
)fld
, cld
, trd
and rdd
aliases for idiv_floor
, idiv_ceil
, idiv_trunc
and idiv_round
. (76f8d8f441
).f
alias for .to_float
. (30b445ade1
)carmichael(a..b, k)
method. (511ca35657
)lucas_carmichael(a..b, k)
method. (511ca35657
)each_carmichael(a..b, k, {...})
method. (511ca35657
)each_lucas_carmichael(a..b, k, {...})
method. (511ca35657
)rat
and rat_approx
methods. (ff011c363d
)abs(x)
, sgn(x)
, gcd(a,b)
, gcdext(a,b)
and lcm(a,b)
methods. (323aebbc29
).version()
and .numeric_version()
methods. (4c606422c8
).version()
and .numeric_version()
methods. (4c606422c8
).sqr
method. (426b3d3b1e
).ascii2bits
method. (6dbe81691d
)a5b785c029
)#-n
to be used, which will count backgrounds. (08a7c0b1fa
)pretty
alias for stringify
in the Number classes. (6f7e128c16
)Sys.readline
alias for Sys.scanln
. (86a15c509f
)Polynomial()
and Mod()
. (3896b9a8ae
)is_cyclic(n)
for better performance. (5b3be4f773
)is_lucas(n)
for better performance with n <= 10^1000
. (f49f8a6a10
)is_lucas(n)
for native integers. (2267e2b16e
)iroot(n,k)
for positive native values of n
. (da4fbc5856
)shift_left()
for native unsigned integers. (9ff3f81781
)special_factor(n)
for much better performance. (8deefb5fb8
, 2605b846d9
)primes(a,b)
method when b
is a native integer. (d145135ceb
)sigma(n)
and sigma0(n)
for native integers. (9c928a8510
)7bca926ac9
)9eda1e00a7
)a9f071ba5c
, 4d1122ea89
, 5ac2cda3bf
)is_almost_prime(n,k)
and is_omega_prime(n,k)
for numbers with very large factors. (f7656180e8
)Polynomial()
to accept an array of pairs as input. (0f4339bf0d
)eval()
method to recursively evaluate the values of polynomials. (7beedb8a76
)expnorm(n,b)
method to support any b > 1, including floating-point values. (7544d9a7d4
)sum_primes
method to accept and additional argument k
. (2c0a42b68c
)inverse_*
methods with a native integer. (4bc9723263
)50a6bc29df
)*_factor
methods. (741399a046
)is_carmichael(n)
for some special n
. (b729120eb0
)All changes: https://github.com/trizen/sidef/compare/22.07...22.12
1 rok temu 410 commitów w master od tego wydania
special_factors(n, tries=1)
method. (272ec42727
)gcd_factors(n, [a,b,c,...])
method. (ef7938a59d
)pell_factor(n, tries=1e5)
method. (f6c4333de3
)cyclotomic_factor(n, bases...)
method. (39ba86fc31
)is_perfect(n)
method. (9c4c74f055
)n.is_squarefree_almost_prime(k=2)
method. (1a7812a0ae
)composite_lower(n)
and composite_upper(n)
methods. (6c481306a6
)composite_count_lower(n)
and composite_count_upper(n)
methods. (dc92b4cd7a
)prime_power_lower(n)
and prime_power_upper(n)
methods. (2d5efab079
)prime_power_count_lower(n)
and prime_power_count_upper(n)
methods. (f884606b8d
)nth_omega_prime(n,k=2)
method. (bbc89237bb
)nth_almost_prime(n, k=2)
method. (3d61414744
)nth_squarefree_almost_prime(n, k=2)
method. (271fcdb2f6
)nth_powerful(n,k=2)
method. (7d8d695522
, e1180f3c9a
)nth_prime_power(n)
method. (9e4b34e26c
)nth_squarefree(n)
method. (03006f7f0d
)nth_powerfree(n,k=2)
method. (5eb73f154d
)next_powerfree(n,k=2)
method. (5485e847fa
)next_squarefree_almost_prime(n,k=2)
method. (f1c30f55da
)next_omega_prime(n,k=2)
method. (6023b93148
)next_semiprime(n)
method. (4295892eee
)next_almost_prime(n,k=2)
method. (9608c7ff64
, 8a45f5f5b8
)next_powerful(n,k=2)
method. (79c5c5a067
)next_prime_power(n)
method. (764eab5d9a
)k.smooth_divisors(n)
and k.rough_divisors(n)
methods. (bee1d25899
)prime_powers(a,b)
and prime_powers_each(a,b,{...})
methods. (ae687b8669
)Math.seq(a, b, c, ..., { ... })
method. (0fd19d4da8
, 277fe12b14
)Math.binary_exp(c,x,n,{|a,b| ... })
method. (57845ba183
)each_prime_power(a..b, {...})
, prime_power_count(a..b)
and prime_powers(a..b)
. (2ecf8bb5c7
)is_omega_prime(n,k)
for large n
and k
. (ac7039230e
)is_almost_prime(n,k)
for large n
and k
. (c6188a9c9e
)nth_composite(n)
for large n
. (8c47ffd6a8
, 6c481306a6
).factor
method to accept an optional block. (660429aca3
)Math::Prime::Util::primes()
in more places when Math::Prime::Util
is available. (fe757df40d
)sum_of_squares(n)
: factorize n
only once. (590fc97440
)Math::Prime::Util
where possible, even when it's an older version. (806e7c08e5
)smooth_part
and rough_part
methods. (bee1d25899
)squfof_factor(n,tries)
now defaults to tries=1e4
, when no value is given. (3c831cd569
)Math.gcd_factors(n,arr)
to multiply to n
. (058b71fec5
).dump
on the result objects. (fc14efe1ba
)b3b21baec8
)nth_composite(n)
, for large n
. (c8493b893f
)bsearch_inverse
. (e0370a8a02
)All changes: https://github.com/trizen/sidef/compare/22.05...22.07
2 lat temu 471 commitów w master od tego wydania
binomialmod(n,k,m)
method. (798dcd57c0
, cb18caf341
, 1c1e12b60a
, 774ec4122e
)sum_of_squares(n)
method. (b8b5e20991
)difference_of_squares(n)
method. (5a94bf6336
)lnsuperprimorial(n)
method. (248b18f76a
)chebyshev_factor(n,B,x)
method. (763b976ed3
)mbe_factor(n,tries=10)
method. (e1bd235936
)stringify
method to the Number classes. (564f87aa3f
)cyclotomic(Mod(x,m), n)
method. (9a00535733
)quadratic_formulaQ(a,b,c)
method. (70505ff180
)cubic_formula(a,b,c,d)
method. (ef6c16afa2
)cyclotomicmod(n,x,m)
method. (4c75c2dee5
)bellmod(n,m)
method. (502244cc86
)smooth_numbers(n, [p1, p2, ...], {|n,p| ... })
method. (d2c20fa129
)digital_root(n,b=10)
method. (ce91e59e97
)modular_quadratic_formula(a,b,c,m)
method. (3619fbd344
)Math.gcd_factors(n, array)
method. (bfc211b579
)derivative(f)
method. (ae33b89a07
).slices(n)
method. (6dfb5ffb6a
)flush_cache
method. (169f7fe948
)chebyshevU
and chebyshevT
methods. (1365a3a96d
)50343bb6fe
)33984c68b9
)k.almost_prime_count(n)
and k.omega_prime_count(n)
for native n
. (7ebdc6c0ef
)Math::Prime::Util::is_almost_prime()
for native integers in Number is_almost_prime(n,k)
. (a4315a44af
)Math::Prime::Util::znorder()
in is_over_psp
for small prime factors. (0f061aa3a0
)sum
and prod
method for non-Number objects as well. (43a4856454
)is_over_psp(n)
for numbers that are not overpseudoprimes. (cbd78be327
)sumdigits(n,b)
and digits(n,b)
for large n
and large b
. (389d2c16f7
)liouville_sum
method to accept an additional argument. (360f40257c
)sum_remainders(n,v)
method to support negative v
. (55ddc2c218
)exp(n)
method to accept an additional argument. (30b1002dc2
).to_n
method to accept an optional argument. (7e0a93de93
)run
method, in addition to call
. (5914d6f26b
)all_prime(...)
when one of the terms is not prime. (f6e71b7adc
)sidef -t
: show at the end a list with the scripts that failed to run. (8c09720587
)e69bb7a2ec
)(a/b) % m
when m is an integer and gcd(b, m) != 1
. (908ce38823
)Rmpz_bin_ui
over Rmpz_bin_uiui
, as it is considerably faster, especially for large n
. (f7f3cf0a8b
)#!/usr/bin/perl
to #!/usr/bin/env perl
in bin/sidef. (822cbb66f8
)mod
. (c016dea501
)cyclotomic(n, x)
and cyclotomicmod(n,x)
. (83fe7133d5
)-s
. (6efa33da8e
)array => 1
for Block slurpy array parameters. (954cf77580
)divmod(a,b,m)
when a
is exactly divisible by b
. (38fe85556f
).uncache
on a function that was not cached. (dad21c50d8
)3a69907fee
)All changes: https://github.com/trizen/sidef/compare/22.03...22.05