Activity
From 04 Jul 2019 to 02 Aug 2019
02 Aug 2019
-
22:43 Slug #1302 (Rejected): Factorization mod p
- My fault! The factorization is actually rather fast (since it is mostly a square-free decomposition). The slow part...
-
- CoCoALib took longer than expected to factorize *@x^11009 - 2@* modulo 109 (or was it 101?)
Anyway, @11009 = 101*109...
31 Jul 2019
-
- I have implemented it: the real work is done by GMP.
Added doc; accessible from CoCoA-5. No test/example.
-
- Add a new function *@primorial@*, the product of al primes up to a given limit.
-
- Fixed. I'll add some tests.
-
- @CoprimeFactorBasis@ gives wrong answers when args are negative. Here is a simple example in CoCoA-5...
29 Jul 2019
-
- Other candidates:
* *@ConstantPart@*
* *@ValueAtZero@* or *@ValueAt0@*
* *@ConstantCoeff@* or *@ConstantCoeffic... -
18:20 Feature #1299: New fn ConstantTerm?
- I think it could be useful.
But I wouldn't call it @ConstantTerm@, because term in CoCoA usually (always?) is equiva... -
- Possible names include *@ConstTerm@* and *@ConstantTerm@*. The result should be an element of @CoeffRing@.
Implem... -
- In some prototype code I would like to use a function which gives me the "constant term" of a polynomial. The result...
16 Jul 2019
-
- I have implemented @FixedDivisor@ which computes gcd of @f(n)@ as @n@ ranges over all integers.
Also exported to ... -
- Add a new function to compute the "FixedDivisor" of a polynomial over @ZZ@ (or over @QQ@ but with integer coeffs).
Also available in: Atom