Introduction. We shall consider two computational problems relating to the torsion group of the jacobian. First, given a curve of genus 2 defined over ℚ, how does one try to find the rational torsion group on the jacobian? Second, given an integer N, how does one try to find a curve whose jacobian has a rational point of order N? Neither of these questions been adequately answered, but we give an idea of the general strategy. the first question, we shall give a method which works well in practice, there is a crude algorithm which should be amenable to improvement. of the recent work on the second question comes down to a bag of tricks for searching for large torsion orders; we shall give the one which has proved successful in finding most torsion orders up to 29 over ℚ. There is yet any method for bounding the possible torsion which can occur.

Computing the group law. Since the next few chapters are to be devoted largely to computational techniques, we shall first illustrate the mechanical details involved in computing the group law on divisors in more detail than the description in Chapter 1. Any reader who is familiar with addition of divisors modulo linear equivalence can safely skip this section. We shall not be requiring any of the structure of the jacobian as a variety here, but are only interested in the group structure.