Dear all,
1. In number fields, some elements are considered as prime, which is
not mathematically correct:
|
sage:S.x=NumberField(x^2+5)
sage:S(11).is_prime()
True
|
|
In the field of rational number, the answer is correct:
|
sage:QQ(11).is_prime()
False
|
On 2015-05-04 14:39, Bruno Grenet wrote:
Dear all,
1. In number fields, some elements are considered as prime, which is
not mathematically correct:
|
sage:S.x=NumberField(x^2+5)
sage:S(11).is_prime()
True
This is really due to S.ideal(11) returning a *fractional* ideal. I
This is incorrect question.
You are actually asking what is sage for?
I need to solve arbitrary equations, so I don't know ahead of time how it
will look like.
On Sunday, May 3, 2015 at 2:55:14 PM UTC+3, Dominique Laurain wrote:
What can be done ?
It depends of what you are looking for. :
I can only agree with the original posting: Sage-6.6 release on gentoo
requires more than 1.5GB for compiling, on a 2GB computer about half a GB
is needed for running gnome (especially now that polkit has an unfixed
memory-leak in gentoo), so during single-threaded builds Swapfile will
On 4 May 2015 at 13:48, Jeroen Demeyer jdeme...@cage.ugent.be wrote:
On 2015-05-04 14:39, Bruno Grenet wrote:
Dear all,
1. In number fields, some elements are considered as prime, which is
not mathematically correct:
|
sage:S.x=NumberField(x^2+5)
sage:S(11).is_prime()
Hello,
I'm having trouble extending a finite field. Any help would be appreciated.
F16 = GF(16, 'g')
F16_x.x = PolynomialRing(F16, 'x')
HH = GF(F16^7, modulus=x^7 + x + 1, name='h')
I basically try to extend 2^4 to 2^4*7 with a degree 7 irreducible.
I get the following.
best,
evrim.
sage: HH
Dear list,
I noticed an annoyance in the IPython notebook (I mean Sage's Ipython
notebook, not IPython ° %load_ext sage...). a line magic %maxima exists,
but seems to open an interactiove contol woth Maxima, that one cannot exit
of.
What I'd like to have is somthing close to the %%R cell
Here it is:
F16.extension(modulus=x^7+x+1)
On Monday, May 4, 2015 at 5:02:52 PM UTC+3, Evrim Ulu wrote:
Hello,
I'm having trouble extending a finite field. Any help would be appreciated.
F16 = GF(16, 'g')
F16_x.x = PolynomialRing(F16, 'x')
HH = GF(F16^7, modulus=x^7 + x + 1, name='h')
I also noticed that ctrl-d doesn't work (probably captured by the browser)
so interactive subshells can't be left. This ought to be a general IPython
notebook question, but I don't know the answer.
As you said, IPython distinguishes single percent = line, and double
precent = cell magics.
On 4 May 2015 at 15:22, Evrim Ulu evrim...@gmail.com wrote:
Here it is:
F16.extension(modulus=x^7+x+1)
To quote from the documentation of the extension() method used here:
Extensions of non-prime finite fields by polynomials are not yet
supported: we fall back to generic code:
follwed by an
I see that, thanks for the info.
Actually F16.extension(..).gen().multiplicative_order() gives
NotImplementedError
So basically, if i want to simulate the behaviour I can take two poly
f(x), g(x) and generate a field using modulus f(g(x)) composition i
guess.
best
evrim.
2015-05-04 17:55
On Monday, May 4, 2015 at 7:58:19 AM UTC-7, Evrim Ulu wrote:
I see that, thanks for the info.
Actually F16.extension(..).gen().multiplicative_order() gives
NotImplementedError
So basically, if i want to simulate the behaviour I can take two poly
f(x), g(x) and generate a field using
Thats right f(g(x)) is not irreducible obviously, shame on me.
I did this to get the order:
sage: (k[x](x^7+x+1)).roots()[0][0].multiplicative_order()
127
First root, multiplicative order.
The real confusion comes from the notation I guess. When you said
k[x](x^7+x+1) i obviously thought we are
Cython was using too much memory, should be fixed in recent beta.
On Monday, 4 May 2015 07:14:18 UTC-6, 94n...@gmail.com wrote:
I can only agree with the original posting: Sage-6.6 release on gentoo
requires more than 1.5GB for compiling, on a 2GB computer about half a GB
is needed for
One more question If I may ask.
Is there a way to get the minimal poly of some conjugates over GF(2^4)?
I always end up degree 28 in this case, i want to see some of degree 7.
I've tried to embed it into GF(2^4)[x] and factor yet no luck.
Best,
evrim.
2015-05-04 20:04 GMT+03:00 Evrim Ulu
On Monday, May 4, 2015 at 1:42:21 PM UTC-7, Emmanuel Charpentier wrote:
Six month and a few versions of Sage and Maxima later, I've checked (in a
different way, see below) that the same problem still exists. Nobody has a
clue about this problem ?
Well, at least if you pass to maxima
SAGE is failing to reap QEPCAD processes, leaving a defunct process for
each spawned QEPCAD instance. To reproduce:
$ ./sage/sage -version
Sage Version 6.4.1, Release Date: 2014-11-23
$ sage -python
Python 2.7.8 (default, Nov 23 2014, 07:46:55)
[GCC 4.9.2] on linux2
Type help, copyright,
Six month and a few versions of Sage and Maxima later, I've checked (in a
different way, see below) that the same problem still exists. Nobody has a
clue about this problem ?
sage: reset()
sage: var(x,mu,sigma)
(x, mu, sigma)
sage:
Mucking around with whitespace is necessary with the current version of the
maxima() function : something here doesn't like to receive empty lines.
Furthermore, Maxima grammar, a bit Lisp-like (minus parentheses), doesn't
differentiate betw een quantities of whitespace (in other words, it isn't
19 matches
Mail list logo
