bash-2.05a$ mwrank3
Program mwrank: uses 2-descent (via 2-isogeny if possible) to
determine the rank of an elliptic curve E over Q, and list a
set of points which generate E(Q) modulo 2E(Q).
and finally search for further points on the curve.
For more details see the file mwrank.doc.
For details of algorithms see the author's book.

Please acknowledge use of this program in published work, 
and send problems to John.Cremona@nottingham.ac.uk.

Version compiled on Feb 11 2003 at 17:40:15 by GCC 3.2.1
using base arithmetic option LiDIA_ALL (LiDIA bigints and multiprecision floating point)
Using LiDIA multiprecision floating point with 15 decimal places.
Enter curve: [0,10,0,-32,-320]

Curve [0,10,0,-32,-320] :       Working with minimal curve [0,1,0,-65,-161]
        [u,r,s,t] = [1,-3,0,0]

1 points of order 2:
[-7 : 0 : 1]

Using 2-isogenous curve [0,40,0,128,0]
-------------------------------------------------------
First step, determining 1st descent Selmer groups
-------------------------------------------------------
After first local descent, rank bound = 2
rk(S^{phi}(E'))=        2
rk(S^{phi'}(E))=        2

-------------------------------------------------------
Second step, determining 2nd descent Selmer groups
-------------------------------------------------------
After second local descent, rank bound = 2
rk(phi'(S^{2}(E)))=     2
rk(phi(S^{2}(E')))=     2
rk(S^{2}(E))=   3
rk(S^{2}(E'))=  3

Third step, determining E(Q)/phi(E'(Q)) and E'(Q)/phi'(E(Q))
-------------------------------------------------------
1. E(Q)/phi(E'(Q))
-------------------------------------------------------
(c,d)  =(-20,68)
(c',d')=(40,128)
First stage (no second descent yet)...
(2,0,-20,0,34):  (x:y:z) = (1:4:1)
        Curve E         Point [2 : 8 : 1], height = 0.480233071046199
After first global descent, this component of the rank = 2
-------------------------------------------------------
2. E'(Q)/phi'(E(Q))
-------------------------------------------------------
First stage (no second descent yet)...
(-1,0,40,0,-128):  (x:y:z) = (2:4:1)
        Curve E'        Point [-4 : -8 : 1], height = 1.0378434166822
        Curve E         Point [1 : 7 : 1], height = 2.07568683336441
After first global descent, this component of the rank = 2

-------------------------------------------------------
Summary of results:
-------------------------------------------------------
        rank(E) = 2
        #E(Q)/2E(Q) = 8

Information on III(E/Q):
        #III(E/Q)[phi']    = 1
        #III(E/Q)[2]       = 1

Information on III(E'/Q):
        #phi'(III(E/Q)[2]) = 1
        #III(E'/Q)[phi]    = 1
        #III(E'/Q)[2]      = 1

-------------------------------------------------------

List of points on E = [0,1,0,-65,-161]:

I.  Points on E mod phi(E')
Point [-5 : 8 : 1], height = 0.480233071046199

II. Points on phi(E') mod 2E
Point [-6 : 7 : 1], height = 2.07568683336441
-------------------------------------------------------
Computing full set of 4 coset representatives for
2E(Q) in E(Q) (modulo torsion), and sorting into height order....done.

Rank = 2
After descent, rank of points found is 2
Transferring points back to original curve [0,10,0,-32,-320]

Generator 1 is [-8 : 8 : 1]; height 0.480233071046199
Generator 2 is [-9 : 7 : 1]; height 2.07568683336441

The rank has been determined unconditionally.
The basis given is for a subgroup of full rank of the Mordell-Weil group
 (modulo torsion), possibly of index greater than 1.
Regulator (of this subgroup) = 0.531665631644888

 (13.2 seconds)
Enter curve: [0,0,0,0,0]

bash-2.05a$