Version 23.11
Additions
- Added the
PolyMod([...], m)built-in class. (fe8303d) - Added the PolyMod
chinese(...)method. (fada375) - Added the Gauss
factor(z)andfactor_exp(z)methods. (8827635) - Added the Gauss
divisors(z)method. (805442f) - Added the Number
is_bfsw_psp(n)method. (762af27) - Added the Number
totient_range(a,b)method. (17aa258) - Added the Number
proper_sigma0(n)method. (17aa258) - Added the Number
proper_divisors(n)method. (17aa258) - Added the Number
mobius_range(n)method. (17aa258) - Added the Number
is_deficient(n)method. (17aa258) - Added the Number
is_amicable(n,m)method. (17aa258) - Added the Number
linear_congruence(n, r, m)method. (219320b) - Added the Number
bphi(n)method. (a121ecd) - Added the Number
iphi(n,k=1)method. (68049c4) - Added the Number
nuphi(n)method. (8bd9444) - Added several more Polynomial methods. (4d18279)
Improvements
- Optimization in Number
modular_quadratic_formula(a,b,c,m)whengcd(2*a, m) == 1. (6f88a08) - Return ealry if input is a prime number in Number
special_factor(n). (bae4ff1) - Extended the Number
aliquot(n)method to accept an extra argument. (17aa258) - Minor optimization in Number
trial_factor(n,lim). (1b781e9) - Minor performance improvements in Number
is_powerful(n,k). (455eeed) - Optimized Number
is_div(n,k)for native integers. (15dc482) - Better performance in Number
k.powerful_count(n)for non-nativen. (9d131a7) - Optimized the Number
divisors(n,k)method for better performance. (e662b70) - Generalized the Number
phianduphimethods to accept an extra argument. (af72440)
Bug-fixes
- Fixed an issue in Number
modular_quadratic_formula(x,y,z,m)forx != 1. (219320b) - Fixed a minor issue in Number
irand(0,x). (f92fbc5) - Fixed two rare issues in Number
is_almost_prime(n,k)andis_omega_prime(n,k). (bc745eb) - bin/sidef: add to history only words <= 50 chars in length. (6e4ba2a)
- Make
Range::Range,Block::TryandBlock::Forkreal objects, by inheriting fromSidef::Object::Object. (5322489)
All changes: 23.10...23.11