Works for me:
sage: sr = mq.SR(1,1,1,4, gf2=True, polybori=True)
sage: K = sr.base_ring()
sage: a = K.gen()
sage: K = [a]
sage: P = [1]
sage: F,s = sr.polynomial_system(P=P, K=K)
sage: F.groebner_basis()
[k100, k101 + 1, k102, k103 + k003, x100 + 1, x101 + k003 + 1, x102 + k003 +
1, x103 + k003,
Hello,
This appears to be a bug in the evaluation of the incomplete Gamma function
in the older PARI version(s) used by Sage up to and including 6.3. The
computation is correct in the newly released Sage 6.4, which uses the
recent stable PARI release 2.7.1.
(See also http://trac.sagemath.org/
Oh, yes, this is on openSUSE 13.1 on AMD FX(tm)-8320 Eight-Core Processor,
Sage Version 6.3, Release Date: 2014-08-10.
On Thursday, November 13, 2014 11:16:58 PM UTC-8, shersonb wrote:
>
> Hello~
>
> I am attempting to write a script in which I would like sage to solve
> some symbolic inequalit
Hi,
I'm working with Sage 6.3 on a macbook pro with OSX10.8.5.
When I use some function of the module sr.mq
(http://www.sagemath.org/doc/reference/cryptography/sage/crypto/mq/sr.html),
I have a bug:
sage: sr = mq.SR(1,1,1,4, gf2=True, polybori=True)
sage: K = sr.base_ring()
sage: K
Finite Fiel
>
>
> However,
> plot(sin,[x,-2*pi,2*pi],figsize=4).show()
> woks as advertised. This seems to be bound to recent changes in the
> management of display modes for the new ipython needs.
>
>>
>>
Oh yes. You might want to see http://trac.sagemath.org/ticket/17170 for
some possible ideas on how to