[sage-support] Can Sage do high-precision polynomial integration?

you can also use Pari/GP and mpmath from Sage. See pages 312-314 of . Paul Zimmermann -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an em

[sage-support] Dealing with 'NaN' values

Hi Vladimir, 'NaN' means "Not a Number". It might produced by some uninitialized value, or the arithmetic of some invalid arithmetic operation, like sqrt(-1.0), 0/0, Inf - Inf, ... You should first investigate why you get such values in your array, since simply ignoring them might be wrong

[sage-support] Multiplying big polynomials

Hi Stephen, as said in http://osdir.com/ml/sage-devel/2010-04/msg00598.html, you should contact Andreas Enge or Joris van der Hoeven who are specialists of this topic. In particular you might have a look at MPFRCX (http://www.multiprecision.org/index.php?prog=mpfrcx). Paul Zimmermann --

[sage-support] Unintuitive behavior of round()

Hi Lorenzo, the strange behaviour of round() is explained in the documentation: sage: u.round? ... This method evaluates an expression in "RR" first and rounds the result. This may lead to misleading results. sage: RR(u).round() 207855083711803936 sage: RealField(100)(u).rou

[sage-support] qd library in Sage

to answer the original question, here is how we can decompose in Sage a 35-digit constant into three 53-bit floating-point values: sage: R120 = RealField(120) sage: R53 = RealField(53) sage: x = R120(pi) sage: x 3.1415926535897932384626433832795029 sage: a = R53(x) # extracts the 53 most significa

[sage-support] Deriving an irreducible polynomial for F_2

Dear Clinton, all irreducible polynomials of degree n over GF(2) can be obtained by factoring x^(2^n)+x, and keeping only factors of degree n: sage: P. = GF(2)[] sage: factor(x^(2^5)+x) x * (x + 1) * (x^5 + x^2 + 1) * (x^5 + x^3 + 1) * (x^5 + x^3 + x^2 + x + 1) * (x^5 + x^4 + x^2 + x + 1)

[sage-support] multivariable factorization over ZZ, QQ, GF(p) -- Singular issue?

John, > I can easily factor mod two primes around 10^7 and then use CRT, > though that is a bit of a pain. So my question is: what's this limit > on the size of primes p for which factorization over GF(p)[X,Y] is > possible, where does this limit come from, and is it documented? the limi

[sage-support] Implementation of Lenstra-Lenstra-Lovesz Algorithm

Hi, > I have written following Lattice Reduction Algorithm. However, it does not > work properly (does not matche with the LLL algorithm > implemented in Sage). It will be great for me if any one check the program. the output of the LLL algorithm is not unique. You have to check that the o