On Saturday, February 23, 2013 5:57:48 PM UTC-8, kcrisman wrote:
>
>
>
> On Saturday, February 23, 2013 4:00:54 PM UTC-5, Robert Gross wrote:
>>
>> Hi,
>>
>> I upgraded to 5.7, and I get an error from zn_poly-0.9.p9 when running
>> the quick self-test: nuss_mul()... FAIL!.
>>
>> This is on a
On Saturday, February 23, 2013 4:00:54 PM UTC-5, Robert Gross wrote:
>
> Hi,
>
> I upgraded to 5.7, and I get an error from zn_poly-0.9.p9 when running the
> quick self-test: nuss_mul()... FAIL!.
>
> This is on a Mac OX 10.6. I did manage to install the rest of sage-5.7,
> and I can start s
Hi,
I upgraded to 5.7, and I get an error from zn_poly-0.9.p9 when running the
quick self-test: nuss_mul()... FAIL!.
This is on a Mac OX 10.6. I did manage to install the rest of sage-5.7,
and I can start sage successfully, so I can try to test anything that
anyone can suggest to pinpoint the p
I think you have more chances if you work in QQ['a']['t1,t2']. In any case,
it seems that it is better to convert to your ring using
P(f.polynomial(QQ)) than performing substitutions.
sage: K=QQ['a']['t1,t2']
sage: K1=SR['t1,t2']
sage: f=SR(K.random_elemen
Hello,
is it possible to know which module or program is used in backstage. Why ?
As a french teacher, I'm sometimes tortured so as to inevitably use
Windows. [?]
So I would like to directly use Python packages rather than a virtual
machine
if it is possible.
Best regards.
Christophe BAL
--
You
Suppose I have a symbolic expression f( t1, t2) which can be interpreted as
a multivariate polynomial in t1 and t2., e.g.
a = var('a')
f(t1,t2) = a*t1+t2
To make this clear to Sage I say
P.=PolynomialRing(SR)
g = f.polynomial(QQ).subs(t1=p1,t2=p2)
This works but becomes very slow when the sy
