[sage-support] test

-- 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 email to sage-support+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/

[sage-support] test for floats and co.

Related to a recent discussion, is there a (simple) way to find whether an expression contains non exact explicit numbers? For example: M1=matrix(1,2,[1,x+2]) M2=matrix(1,2,[1,x+2.]) mytest(M1) → True mytest(M2) → False Guillermo -- You received this message because you are subscribed to the G

Re: [sage-support] Test Site Applications

This message from Rob was a (boring) accident, and was meant to be sent to a different list.Please ignore. On Sat, Dec 9, 2017 at 10:57 AM Rob Beezer wrote: > I need to [...] a mildly tedious affair. > -- -- William Stein -- You received this message because you are subscribed to the Goog

[sage-support] Test Site Applications

I need to package all the test site applications into one massive PDF, a mildly tedious affair. This cannot be an appendix, but should go in "Supplemental Material". But it should not look like effusive "letters of support." The AMATYC material follows the guidelines perfectly - just a factu

[sage-support] test whether a system of multivariate polynomial equations is solvable

Hello, I'm implementing a code generator for simulation of simplicity (a way to handle degeneracies in exact geometric computation). This involves constructing and analyzing polynomials over a number of coordinate variables plus one special infinitesimal variable 'e'. For example, here's the pol

[sage-support] Test if p(x) is in a ring generated by polynomials

I am not familiar with algebraic geometry or its terminology and new to sage. p_1,...p_n and q are elements of Z[x_1,...,x_n]. In my context I have some evidence that q can be written as something like q = p_1*p_2 + ... + p_5*p_6. In other words q is a degree 2 polynomial in the p_i's. Can Sage fi

Re: [sage-support] Test if a variable is numerical

Thank you !!! :-) Would there be any way to do the same thing without having to import RR in all of my functions, though ? It's really mainly to distinguish numerical values from different types, so I thought there may be a Python way to do it ... Though it perfectly works like that ! :-) Nathann

Re: [sage-support] Test if a variable is numerical

Try doing x in RR - Robert On May 7, 2010, at 2:38 PM, Nathann Cohen wrote: Hello everybody !!! I am trying to find out how to check whether some Sage variable is numerical (let's say real, as opposed to None, False, {}, Set([]), etc..), but was not lucky on Google... ^^; Do you know the f

[sage-support] Test if a variable is numerical

Hello everybody !!! I am trying to find out how to check whether some Sage variable is numerical (let's say real, as opposed to None, False, {}, Set([]), etc..), but was not lucky on Google... ^^; Do you know the function I am looking for ? :-) Thank youu !!! Nathann -- To post to this g

[sage-support] test if an expression is polynomial

Dear support the following two commands can be used to test, if a function is a polynomial or quotient of two polynomials in x variable. sage: (x^3+x+3+1/(x))._maxima_().polynomialp([x]).sage() 0 sage: ((x^3+x+3+1)/(x^4+3))._maxima_().polynomialp([x],"constantp", "integerp").sage() 1 Is there a

[sage-support] test failing for sage 3.2.3, CentOS-5 x86_64 devel/sage/sage/rings/finite_field_ntl_gf2e.pyx

Hi, I have just download and compile sage-3.2.3 on CentOS-5 x86_64 a RHEL5 clone and the make tests is failing for devel/sage/sage/rings/finite_field_ntl_gf2e.pyx -- The following tests failed: sage -t "devel/sage/sa

[sage-support] Test failure for r.py

Hello Folks! Could you help to debug the failure of the following test? sage -t devel/sage/sage/interfaces/r.py Sage was compiled from source (3.1.3) with export MAKE="make - j8" (machine has 8 processors and run RedHat Enterprise Linux 5, 64-bit version). I've upgraded to 3.1.4, and g