When sage-nt (nt = Number Theory) was created it was announced to sage-
devel, and a second announcement was made recently.
I'm sure it used to be listed on the Sage website along with the
others, but when I just looked I could not see it.
John Cremona
On Jan 28, 12:28 am, Robert Bra
+ 2*t^12 + 2*t^11 + 2*t^10 + 2*t^9 + t^7 +
t^6 + t^5 + t^4 + t^3 + t^2 + t + 1)/(t^17 + t^9 + t)
sage 3.4.alpha0 gives the same thing.
John Cremona
2009/3/7 Alex Lara :
>
> Hi guys,
>
> I recently upgrade sage from 3.2.3 to 3.3. I'm also have sage 3.1.1
> The thing is that th
I am hoping that someone who has worked on that code, such as Martin
Albrecht, might reply as might know what is going on. It should not
be too hard to fix.
I could not find a relevant trac ticket so am opening one now.
John Cremona
2009/3/7 Alex Lara :
>
> Just as I thought. So th
It is now ticket number 5451: see http://trac.sagemath.org/sage_trac/ticket/5451
John Cremona
2009/3/7 John Cremona :
> I am hoping that someone who has worked on that code, such as Martin
> Albrecht, might reply as might know what is going on. It should not
> be too hard to fix.
&g
just gave up, since I can do without graphics, but it
would be nice to know what the problem is.
John Cremona
2009/3/7 Jason Grout :
>
> Kwankyu wrote:
>> Hi,
>>
>> In my Sage 3.3 notebook on Mac OS 10.5/Firefox 3.07, Jmol 3d graphics
>> are shown as just black rectang
It turns out that the bug underlying this has already been fixed in
ticket 5434 which has been merged in 3.4.rc1, so this problem will not
arise once 3.4 has been released.
2009/3/7 John Cremona :
> It is now ticket number 5451: see
> http://trac.sagemath.org/sage_trac/ticket/5451
&g
That's interesting -- there is no java at all listed in the list of
plugins. This is with 32-bit ubuntu.
John
2009/3/7 gerhard :
>
>> with all sorts of JRE's
> one possible reason for this problem is
> the plugin firefox may be using.
>
> check by typing
> about:plugins
> in the title bar,
>
> You want to have the xul-runner thing point to a Sun plug in, not an
> Open JDK or IcedTea or some such thing. You'll probably get some
> choices. (Presuming you have the right packages installed.)
>
> THEN check about:plugins after a restart of Firefox. Good luck. ;-)
ernatives --config xulrunner-1.9-javaplugin.so
>
> and pick the one that looks like it comes from Sun.
>
> Rob
>
> On Mar 7, 2:22 pm, John Cremona wrote:
>> Thanks for the detailed instructions. I have never heard of
>> xulrunner. Something of that name was insta
I successfully built SAGE 2.7 from scratch on my debian etch laptop a
couple of days ago. But today I tried sage -upgrade to get 2.7.1 and
failed -- "no space left on device". At this point the sage directory
contains 1.2G.
Perhaps I'll need a new laptop to continue to upgrade
+Infinity
>
> sage: E = EllipticCurve([0,1])
> sage: P = E([-1,0])
> sage: P.order()
> 2
>
>
>
>
>
> >
> >
> > >
> >
>
>
> --
> William Stein
> Associate Professor
prime):
e=EllipticCurve([0,-1,1,0,0]);
ap=e.aplist(1);
plist=prime_range(1);
[1+plist[i]-ap[i] for i in range(prime_pi(10000))]
John Cremona
On 8/10/07, Justin <[EMAIL PROTECTED]> wrote:
>
> Hi again everyone,
>
> I'm playing around with this project exploring Hass
e.sea(7) already doesn't match Mr. Cremona's and my output!
>
> Any suggestions?
> -Justin
>
>
> On Aug 10, 11:50 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> > On 8/10/07, John Cremona <[EMAIL PROTECTED]> wrote:
> >
> >
>
ks again for bearing with me.
>
> aplist was all I needed. Tate & Silverman doesn't have much on Modular
> forms, would Silverman's "Arithmetic of Elliptic Curves" be better
> suited? Any reference is welcome.
>
> Everyone has been very helpful.
> -Justin
list but upload it somewhere.
>
> Martin
>
>
> --
> name: Martin Albrecht
> _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
> _www: http://www.informatik.uni-bremen.de/~malb
> _jab: [EMAIL PROTECTED]
>
>
> >
>
--
John Cremona
--~--~---
(2^5)
> > > > > sage: V = k.vector_space()
> > > > > sage: z = (1+a)^17; z
> > > > > a^3 + a + 1
> > > > > sage: V(z)
> > > > > (1, 1, 0, 1, 0)
> >
> > > > > This seems to be the same output you gave for to_V(
; where the coefficients are rational. This can be transformed to:
> >
> > > xprm^2 - d*yprm^2 + N = 0 (2)
> >
> > > There are alot of websites that talk about finding integer solutions
> > > to these equations with integer coefficients
onder if there is any
> support for adding an option to eigenspaces to use (a).
> - David Joyner
>
> >
>
--
John Cremona
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, se
aying
> I[sz] = p
> would do essentially the same, wouldn't it?
>
> I can not believe that such a simple operation in such a small setting
> takes such a long time.
>
> How can i do better?
>
> Yours sincerely
>Simon
>
>
> >
>
--
John
As an alternative, which would give you much more than just pari/gp,
you could install Sage (www.sagemath.org) which is fully supported on
the mac, and then you will have pari/gp. Sage will install everythng
it needs.
John Cremona
CC'd ro sage-support
On 06/11/2007, Louis Granboulan &l
all (and is likely to be untrustworthy by some, also).
John
On 07/11/2007, mabshoff
<[EMAIL PROTECTED]> wrote:
>
>
>
> On Nov 7, 5:08 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > On Nov 7, 2007 4:34 AM, John Cremona <[EMAIL PROTECTED]> wrote:
&
u can read even without being a member (which I don't know).
I seem to remember that in a previous email you mentioned not wanting
to have a Google account. I would be interested to know why (no
hurry, we can chat in Bristol).
John
--
Jo
x = u^3
>b = 4*x*v
>a = (v-u)^3*(3*u+v)
>A = a/b-2
>x = x/v^3
> b = x^3 + A*x^2 + x
>E = EllipticCurve(K,[0,b*A,0,b^2,0])
>return factor(E.cardinality())
>
> >
>
--
John Cremona
--~--~-~--~~~---~--~~
T
That worked!
Thanks
On 08/11/2007, William Stein <[EMAIL PROTECTED]> wrote:
>
> On Thu, 08 Nov 2007 20:33:22 -, John Cremona <[EMAIL PROTECTED]> wrote:
>
> >
> > This happened (and the problem was still there on restarting):
> >
> > sage: sa
8.12?
[On kubuntu 7.10]
--
John Cremona
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups.google.com/group/sa
t; && hg update
abort: untracked local file 'sage-wiki' differs from remote version
sage: quit
Exiting SAGE (CPU time 0m0.12s, Wall time 58m30.86s).
John
On 08/11/2007, William Stein <[EMAIL PROTECTED]> wrote:
>
> On Nov 8, 2007 8:22 PM, John Cremona <[EMAIL PROTE
I am currently making sure that my code compiles ok with gcc 4.2.1 and
will upload a patch so this will be fixed soon.
John Cremona
On 23/11/2007, William Stein <[EMAIL PROTECTED]> wrote:
>
> On Nov 22, 2007 7:43 AM, Andrzej Giniewicz <[EMAIL PROTECTED]> wrote:
> >
&
he sage binary is crashing (mostly, I'm just curious). Thank you.
> > >
> > > Because the binaries are built for a newer architecture than you have
> > > (Athlon).
> > > This hasn't changed and won't change until I acquire an older
> > > machine
; # ANSWER: Try doing sage: hg_scripts.merge() followed by sage:
> hg_scripts.commit().
>
> > [EMAIL PROTECTED]:~/wdj/sagefiles/sage-2.9.alpha5$ ./sage
> > --
> > | SAGE Version rc4, Release Date: 2007-12-16 |
> > | Type notebook() f
libs/mwrank/wrap.cc:261: error: invalid use of undefined type
> 'struct two_descent'
> sage/libs/mwrank/wrap.h:100: error: forward declaration of 'struct
> two_descent'
> sage/libs/mwrank/wrap.cc: In function 'char*
> two_descent_regulator(two_descent*)'
work.
John Cremona
On 09/01/2008, achrzesz <[EMAIL PROTECTED]> wrote:
>
> Hello
> My question is
> connected with file http://modular.fas.harvard.edu/ent/ent_py
> and especially with checking the associativity law of addition on ell.
> curves.
> When I was trying to perfo
ith respect to a set of polynomial equations. This is quite useful
> for the user who is not aware of Gröbner bases (or the aware-user who prefers
> a simple command). Does a similar command exist in SAGE?
>
> Paul Zimmermann
>
> >
>
--
John Cremona
--~--~-~--~~
gt; > As always, thanks for your help,
> >
> > This is clearly broken. As a band-aide, you can at least
> > numerically integrate as follows:
> >
> > sage: integral_numerical(lambda x: tri_wave(x)^2, -1, 3)
> > (1., 1.4765966227514582e-14)
> >
> > The first
gt; > --
> > | SAGE Version 2.9.3, Release Date: 2008-01-05 |
> > | Type notebook() for the GUI, and license() for information.|
> > --
> >
> > sage: f(x) = -x
> &
data structures (common in mathematics)
> where copying is just not defined or is very expensive.
>
>
> By the way the copy Python function is usually enough to copy
> most Sage objects sufficiently for most purposes. Deep copy
> is needed only in certain special cases, e.g., a list
tutorial (which I do recommend) and then found those books on the
shelf at the place where I work
I'll have another go at Diving now!
John
On 15/01/2008, William Stein <[EMAIL PROTECTED]> wrote:
>
> On Jan 15, 2008 10:12 AM, John Cremona <[EMAIL PROTECTED]> wrote:
> &g
quare()]
[0, 1, 4, 9, 16, 25, 36, 49, 64, 81]
if the elements of this list need further Integer methods to be called on them.
I did eventually find the srange() function, but find its name rather
un-guessable. Why s? Why not Irange, say?
--
John Cremona
--~--~-~--~~
wouldn't want to change it.
>
> Some particular annoyances may be fixable. For instance, you can just
> do:
>
> sage: range=srange
>
> to overwrite Python's built-in range with Sage's for the current
> command-line session. I suppose we could do that
gt;
> sage: [q for q in [1,3,5,..100] if q.is_square()]
> [1, 9, 25, 49, 81]
>
>
> On Jan 22, 2008 12:57 PM, Jason Grout <[EMAIL PROTECTED]> wrote:
> >
> > John Cremona wrote:
> > > Thanks for the detailed explanation -- answering all
question of
odd'th roots of negative reals just leads to horrendous internal
problems if followed through. Maths is not always simple.
John
> Paul Zimmermann
>
> >
>
--
John Cremona
--~--~-~--~~~---~--~~
To post to this group, send email to sage-s
; just want to be able to use Sage instead of Mathematica for an
> exposition of generating functions for Markov chains, where I need to
> compute and display Taylor polynomials of matrices. Hopefully there
> is some way I can keep a polynomial in x-1 from getting simplified
> automatic
nd using .nearby_rational with
> adjusted tolerance...),
> may this method could be useful for others, too ....
> Thanks, Georg
>
>
> >
>
--
John Cremona
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.c
w can i achieve such canonical form?
>
> Is this also worth a ticket?
>
> sage: ((-x^4-1)/(x^2)) == ((x^4+1)/((-1)*x^2))
> True
>
> So, at least "==" works as it should.
>
> Yours sincerely
> Simon
>
> >
>
--
John Cremona
--~--~-~--~
R('A')
> sage: 1/A
> Exception exceptions.RuntimeError: 'maximum recursion depth exceeded
> in cmp' in 'sage.libs.pari.gen.PariInstance.get_var' ignored
>
> Then i had to interrupt with Ctrl-C
>
> Is it possible to work in a polynomial ring over a fraction fiel
a
> difference between the type of questions that are sent to the
> sage-newbie list and those sent to the sage-support list so my thought
> is to discontinue the sage-newbie list.
>
> Ted
>
> >
>
--
John Cremona
--~--~-~--~~~---~--~
of points, but after the fix those both
work very quickly.
John Cremona
On 21 Mar, 18:44, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Fri, Mar 21, 2008 at 9:44 AM, seventeener <[EMAIL PROTECTED]> wrote:
>
> > Hello, I'm using v.2.10.3 on a 32-bit machine
Just one comment: a simple-minded user might say that evaluating
sum(b) where b has at least one entry need not actually require any
coercion of 0, since it only needs to do b[0]+b[1]+... . I know that
is not how sum() is defined, but it could be -- expect that sum() is
pure python.
John
On Ma
Although Justin's solution certainly works, one might consider adding
a "real_part()" function to the quaternion class. But it would not do
to call the function "real_part" since of course it depends on the
ground field (which in the example is QQ and not RR).
I am CC'ing sage-devel since this m
Dear Benedikt,
There is code to compute the Weil pairing using a gp script (written
by me) which sage includes, but at present there is no wrapper for it
to be used in Sage. Either that could be done, or someone could
rewrite that gp script in Sage.
John Cremona
On 01/04/2008, Spit <[EM
pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
> _www: http://www.informatik.uni-bremen.de/~malb
> _jab: [EMAIL PROTECTED]
>
>
>
> >
>
--
John Cremona
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googl
re. First step, I'll open a ticket.
John Cremona
On 07/04/2008, William Stein <[EMAIL PROTECTED]> wrote:
>
> An elliptic curve bug report from a student of Koblitz...
>
>
> -- Forwarded message --
> From: <[EMAIL PROTECTED]>
> Date: Mon, Apr
anyway.
John Cremona
On 07/04/2008, William Stein <[EMAIL PROTECTED]> wrote:
>
> An elliptic curve bug report from a student of Koblitz...
>
>
> -- Forwarded message --
> From: <[EMAIL PROTECTED]>
> Date: Mon, Apr 7, 2008 at 12:39 PM
> Subj
Perhaps the Sage version of the database should have the rounded
analytic Sha values and not the floating point ones (for positive rank
curves, I mean: in the rank 0 case the values are already integers).
Nils, if you get the files
http://www.warwick.ac.uk/staff/J.E.Cremona/ftp/data/allbigsha.*.
)]
sage: b = prime_powers(95,1234)
sage: len(b)
(etc)
John Cremona
On 22 Mar, 16:15, Mike Hansen wrote:
> Hello,
>
> On Mar 22, 7:16 am, christophe van der putten
>
>
>
> wrote:
> > Hi,
> > I am a newbie with sage, a want to save in a text file all p
I think I do understand what Armand is asking. Let's see:
Say I have been using Magma for half an hour. I typed lots of stuff,
including typos etc, and a whole lot of output has scrolled past. Now
I want to keep all the commands that I typed, put them in a file,
sanitize them, ans use them lat
683.
>
> > Kwankyu
>
> I posted a patch athttp://trac.sagemath.org/sage_trac/ticket/5683
>
> Somebody should review it.
The patch now has a positive review.
John Cremona
>
> William
--~--~-~--~~~---~--~~
To post to this group, send email t
The actual cardinality is computed using the pari library (since the
field is a prime field and p<10**18). I the leak is in libsingular it
must come from constructing the curve, not from computing the
cardinality. So it would be worth testing the loop with a new
function which constructs the cur
When an elliptic curve is created the code in the __init__ function in
ell_generic.py (lines 164-5) do cause a multivariate polynomial ring
to be created. In this case it's a new ring each time as the base
field is always a new field.
The reason this is done is that the elliptic curve class deri
On May 2, 5:55 pm, simon.k...@uni-jena.de wrote:
> Dear John,
>
> On 2 Mai, 18:39, John Cremona wrote:
>
> > When an elliptic curve is created the code in the __init__ function in
> > ell_generic.py (lines 164-5) do cause a multivariate polynomial ring
> > to be
Constructor information:
Definition: FormalSum(self, x, parent=Abelian Group of all Formal
Finite Sums over Integer Ring, check=True, reduce=True)
What were you trying to do?
John Cremona
On May 9, 1:00 pm, Christian Nassau wrote:
> Hi,
>
> FormalSum arithemtic appears to be broken
athematica, maple and matlab do the "non-obvious thing" there must
be a good reason for it! And as Mike said, you can always get the
real root by inserting brackets.
John Cremona
On May 14, 6:56 am, Robert Bradshaw
wrote:
> On May 13, 2009, at 9:11 PM, Bill Page wrote:
>
>
>
&
.
John Cremona
On Jun 6, 8:22 am, simon.k...@uni-jena.de wrote:
> Hi!
>
> On 6 Jun., 05:45, Robert Dodier wrote:
>
> > CVS log claims this bug was fixed recently (between 5.17 & 5.18).
> > Here's what I get with Maxima from CVS (5.18+).
>
> > ...
>
> Ve
switch to rational coeffs:
sage: x = polygen(QQ)
sage: f = 2*x**2 - x
sage: f.factor()
(2) * (x - 1/2) * x
Here 2 is the "unit factor" amd the other two are irreducible
polynomials normalised to be monic, which makes sense over a field.
John Cremona
On Jun 17, 7:30 am, Robert Bradshaw
w
(that I can see), which is surely a normal
prerequisite for getting any help at all!
John Cremona
On Jun 17, 8:22 pm, Craig Citro wrote:
> Hi,
>
> > thanks! however, not quite there - how do I get the units in terms of
> > q?
>
> So I just tried this in sage 4.0.2.rc
On Jun 17, 5:34 pm, William Stein wrote:
> 2009/6/17 Robert Bradshaw :
>
>
>
> > On Jun 17, 2009, at 4:05 AM, John Cremona wrote:
>
> >> I think is is easier, both on the eye and for a beginner to
> >> understand:
>
> >> sage: x = polyge
On Jun 22, 7:59 pm, adam mohamed wrote:
> Hi,
>
> Thanks for the very quick response. I will try that tomorrow. Now I
> understand the problem that we met when running the same code in a linux
> machine.
> I am doing this search for cryptographic applications, so I am dealing with
> primes
A quick look at your output suggest that the division poly code is
getting into an infite recursion -- if so, that would explain running
out of memory. I will look into it.
John Cremona
On Jun 23, 2:17 pm, adam mohamed wrote:
> Hi All,
>
> I solve the problem with the memory,
d
> of problems. Is this doable in Sage now?
>
> Best wishes,
>
> Adam
>
> On Tue, Jun 23, 2009 at 1:14 PM, John Cremona wrote:
>
>
>
> > On Jun 22, 7:59 pm, adam mohamed wrote:
> > > Hi,
>
> > > Thanks for the very quick response. I
t random.
John
>
> What I am trying to do is to find elliptic curves over F_p with with point
> of order 4. Idealy I need E( F_p ) = Z/4Z*Z/(big prime)Z.
>
> Best wishes,
>
> Adam
>
>
>
> On Wed, Jun 24, 2009 at 12:49 PM, John Cremona
> wrote:
>>
se there are no more roots
in K. The other two roots would lie in a quadratic extension of K.
The rule is that for an irreducible cubic, the roots can be expressed
in terms of eacho ther (as polynomials) if and only if the
discriminant is a square; which in this case it is not. This can be
r
David is right, you should be possible to do what you want using the
log function in the units module.
When Sage has better support for f.g. abelian groups (which is on its
way, I think) this kind of thing should be simpler to do.
John Cremona
On Jul 9, 11:55 am, davidloeffler wrote:
> On
ok
at the member functions of U.
John Cremona
On Jul 21, 6:01 pm, mac8090 wrote:
> For a field extension over Q of 2 values, for example M=QQ(i, sqrt
> (2)), it is possible to find an absolute field X by the following
>
> L.=NumberField(x^2-2)
> R.=L[]
> M.=L.extension(t^2+1)
On Jul 22, 12:21 pm, davidloeffler wrote:
> On Jul 21, 6:01 pm, mac8090 wrote:
>
>
>
> > For a field extension over Q of 2 values, for example M=QQ(i, sqrt
> > (2)), it is possible to find an absolute field X by the following
>
> > L.=NumberField(x^2-2)
> > R.=L[]
> > M.=L.extension(t^2+1)
>
>
Hi Victor. Although I don't know the answer to your question, I'm
sure that it actually a python question (rather than a sage one) so I
expect that the answer lies somewhere in the wealth of online python
documentation!
Of course someone else might give a more helpful answer...
Jo
with defining polynomial x^2 - 3
To: Real Field with 106 bits of precision
Defn: a |--> 1.732050807568877293527446341506]
See the docstring. You can set all_complex=True to get both
conjugates if needed.
John Cremona
On Jul 24, 10:41 am, mac8090 wrote:
> For a number field X, the comp
I'm on holiday but will look into this when I can.
John Cremona
(author of mwrank, but not of the Sage/msrank interface ;))
On Jul 31, 6:48 pm, cronopio wrote:
> I am using Sage Version 4.1, Release Date: 2009-07-09 on an iMac Intel
> core 2 duo running Mac OS X 10.5.7 to compute th
t page has almost
no information on it.
For the first time in my life I tried running sage on one machine and
connecting from another, and I cannot get it to work.
John Cremona
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To u
Thanks for the replies.
It's on the big wide internet, not local.
On 16 Aug, 19:27, William Stein wrote:
> On Sun, Aug 16, 2009 at 6:49 AM, John Cremona wrote:
>
> > In the docstring for notebook() it says " More documentation is available
> > in the
> &g
0 0 localhost:6012 *:*
LISTEN
which includes a listen on 8000 (and the sage server is running), but
what does that prove?
John
On 16 Aug, 21:22, Kevin Horton wrote:
> John Cremona wrote:
> > Thanks for the replies.
>
> > It's on the big wide internet, not loc
I now can connect to that sage server (running on ubuntu, by the way,
and administered by Bill Hart and myself) but this is from another
machine on the university network so I'll have to try form home too.
I started the server using exactly notebook
(address="selmer.warwick.ac.uk", port=8000, se
Progress report.
After succesfully logging into my own notebook as admin, I started to
set up a few user accounts. I followed the instructions in the
notebook? docstring:
accounts -- (default: False) if True, any visitor to
the
website will be able to
One more thing I just noticed. When I run notebook(...) to start up
the notebook server, the last line displayed is
https://selmer.warwick.ac.uk:8000/?startup_token=634498ad5f3559f3b0121beeb6e0beb8:
No such file or directory
and this may be a clue to the problem.
On 19 Aug, 15:10, John
I think I wrote the ordinal_str function, for the output of certain
messages related to roots of unity. Clearly I did not do a perfect
job: it uses 'st' for 1 mod 10 except for 11, but I think that should
be: 'st' for 1 mod 10 except 'th' for 11 mod 100. Similarly for 2 and
3 mod 10.
I just sa
.multiplicative_generator()^5, I think, and then use a.matrix
() and only keep the W which are stable under that.
I hope this helps,
John Cremona
On Aug 31, 9:28 am, zieglerk wrote:
> Dear list,
>
> Starting from a finite field, say
>
> F = GF (16).
>
> I want to conside
e will not work).
John Cremona
On Sep 18, 3:12 pm, Hendrik wrote:
> Hi,
>
> First of all, I'm very happy with the things I can do with elliptic
> curves over number fields in Sage.
>
> My problem:
> I want to add the complete 4-torsion of E27a3 to the rationals, i.e. I
&g
Dear Tipoy,
This has been on my to-do list for some time -- it is trac ticket
#360! So it is not currently implemented, sorry.
John Cremona
On Sep 28, 11:45 pm, Tipoy wrote:
> Hello: I want to know how to calculate de height matrix of some points
> on an elliptic curve defined over a
See below
On 24 Sep, 13:13, John Cremona wrote:
> Here's a way, using QQbar. To get this to work I had to (1) add a
> trivial function is_square() for elements of QQbar (it did not exist
> but was required i nthe code for constructing points), and also
> correct a typo in the
On 1 Oct, 17:05, John Cremona wrote:
> -- I was expecting full set of roots here. Can anyone see what's
> wrong?
What is wrong is a bug in Sage's code for factoring polynomials over
number fields (which is used to find roots of polynomials over number
fields). This ha
s() (which in this example is the
same).
I think that this thread would belong better on sage-nt.
John Cremona
On Oct 27, 1:17 pm, adam mohamed wrote:
> I would like an exact result, and the lattice I am dealing with is just the
> ring of integers. Say for an element in my field, I woul
it from off campus, I suspect that you are
doing some of the things which I should have been doing.
John Cremona
On Oct 28, 4:16 am, Mike Hansen wrote:
> On Wed, Oct 28, 2009 at 11:10 AM, David wrote:
>
> > I'm getting the picture now I think. I need a user to run the no
I only discovered the -startup
option 5 minutes ago and have ignored most of its output...
John Cremona
On Oct 29, 10:57 pm, William Stein wrote:
> On Thu, Oct 29, 2009 at 3:44 PM, Robert Bradshaw
>
>
>
> wrote:
>
> > On Oct 29, 2009, at 3:39 PM, William Stein wrote:
>
(1),3)(m).echelon_form()
still gives the identity matrix, so this looks bad. (The determinant
is 0 to 10^4 decimals in that example!)
>
> # Ugly
>
> sage: m == n
> True
I think this is a coercion issue. I agree taht the result is not
mathematically nice at all:
sage: m==n
True
sage: m
to be able to test the correct running of certtool when Sage is
built.
John Cremona
On 16 Nov, 09:45, "marc.burw...@googlemail.com"
wrote:
> In my case just waiting for about 10 minutes solved the problem as the
> entropy on the computer where I started sage was too low.
>
>
rom
sage it does not.
John
On Nov 19, 4:26 pm, William Stein wrote:
> On Thu, Nov 19, 2009 at 3:33 AM, John Cremona wrote:
> > I am having exactly the same problem as the original poster. The
> > machine runs 64-bit ubuntu (Linux version 2.6.28-13-generic
> > (bui...@yellow)
that running certtool from the command line now works fine while from
> sage it does not.
>
> John
>
> On Nov 19, 4:26 pm, William Stein wrote:
>
> > On Thu, Nov 19, 2009 at 3:33 AM, John Cremona
> > wrote:
> > > I am having exactly the same problem as the o
that is where improvements should be made (in
this case).
John Cremona
On Nov 20, 9:00 pm, finotti wrote:
> Dear Simon,
>
> On Nov 20, 2:19 pm, Simon King wrote:
>
> > Hi Luis!
>
> > First, I would produce a clone of Sage, in order to not destroy your
> > installati
a solution to
your problem to find all the integer points on the W. model and map
them back.
I do not know of any implementation anywhere which applies to more
general models.
John Cremona
On Dec 7, 12:53 pm, Jaakko Seppälä wrote:
> Hello again!
>
> Is that method general? I tried now
equation is x=193, y=2681. Does that help?
To see the documentation create an elliptic curve E (as above, say, or
try EllipticCurve? to see other ways), and then do
E.integral_points? or E.S_integral_points?
John Cremona
On Dec 7, 12:53 pm, Jaakko Seppälä wrote:
> Hello again!
>
> Is th
g.
Should I stop it first?
Please would someone who understands how this works help out! (and
also say how the documentation should be corrected -- the
documentation for running servers is all over the place and extremely
confusing).
John Cremona
--
To post to this group, send email to sag
volume 1 of Henri Cohen's book
Number Theory (Vol 1: Tools and Diophantine Equations), GTM 239.
John Cremona
On Dec 8, 2:10 am, Yann wrote:
> If you want solution for this precise equation, look for "thue
> equation".
> The thue equations are some of the few for which there ex
301 - 400 of 734 matches
Mail list logo
