On 21/12/2007, bill.p <[EMAIL PROTECTED]> wrote: > > John, > I'm interested in doing some work in this. I've just had a test run > of > point-search and would like to look at the source if that's OK.
Of course it is ok -- open source means open source! > The version of Sage I installed doesn't include the source so I > thought It does really ( we could not distribute Sage without source since lots of that source is GPL). But (as with the other source code in the distribution) the source is in a .spkg file which is a bzip2'd tar file. These are in the directory $SAGE_ROOT/spkg/installed/ and the one containing my code is called cremona* (where * contains some release date). One you have unpacked that (use tar jxvf on linux) go into src/qcurves. The point-searching code is in sieve_search.h/cc. There is also a separate standalone C file in that directory called ratpoints-1.4,c which was written by other people (notable Michael Stoll) and contains within it comments on what it does and how and how to build it and run it. The sieve_search stuff is a conversion of ratpoints-1.4.c into a C++ class. John PS Actually I just realised that you might have downloaded a binary-only version of Sage, which I believe is possible though I have never done it, in which case you might have to get the source separately. In whcih case someone else on the list should be able to tell you how to get that without downloading all 1.8MB of all the sources. > I'd look on the Sage website, but can't locate it there either. > Am I looking in the wrong place? Or do I need to download the > whole source of Sage to be able to do anything useful > (development-wise). > > Bill Purvis (retired software engineer, turned amateur number > theorist) > > On Dec 17, 10:14 pm, William Stein <[EMAIL PROTECTED]> wrote: > > - William > > > > (Sent from my iPhone.) > > > > Begin forwarded message: > > > > > From: bill purvis <[EMAIL PROTECTED]> > > > Date: December 17, 2007 3:05:25 PM MST > > > To: sage-newbie <[EMAIL PROTECTED]> > > > Subject: [sage-newbie] Integer points on Elliptic Curves > > > Reply-To: [EMAIL PROTECTED] > > > > > Anyone have any useful sage code to locate integer points on elliptic > > > curves? I wrote a very crude C program that simply searches over x > > > and y > > > evaluating the LHS and RHS looking for a match, but that's crude and > > > only > > > searches a limited range of X/Y. I've not seen any published > > > algorithms > > > for this, but my experience is still pretty small. Any non-sage > > > algortihms would also be of interest and I might try my hand at > > > converting them to sage if there's nothing already available. > > > > > Bill > > > -- > > > +---------------------------------------+ > > > | Bill Purvis, Amateur Mathematician | > > > | email: [EMAIL PROTECTED] | > > > | http://bil.members.beeb.net | > > > +---------------------------------------+ > > > > -- John Cremona --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
